-
Files can be edited while Hanyuu is reading from them, causing an `Invalid File` error.
This can be fixed in one of two ways:
1. Locking files while streaming using `fcntl.lockf(filename, fcntl.LOCK…
-
### Product
axe-core
### Description
In the [jest_react](https://github.com/dequelabs/axe-core/tree/develop/doc/examples/jest_react) example, color-contrast and link-in-text-block are disabled beca…
-
学习笔记
## leetcode刷题解题总结
### https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/ 去除重复元素
双指针解法: 慢指针i标识不重复元素的位置. j指针依次遍历.
当i和j元素不相等时. i前进1. 并且将i和j的元素交互位置.
时间复杂度: O(N)
…
-
Stacks, at least, can support a rather more efficient (in constant factors) unordered merge than append. This is just plain addition of the numerical representations. We might as well offer it.
-
# Describe the bug
Commit c40a251887853dee30c406bbb94522b35195d912 (fixing issue #4091, merged into master in issue #4072) introduced an endless loop into deque::shrink_to_fit(). In specific constell…
-
From the docs of VecDeque:
"""
A double-ended queue implemented with a growable ring buffer.
The “default” usage of this type as a queue is to use push_back to add to the queue, and pop_front t…
-
https://github.com/show-matz/CL-STL is an attempt to implement STL in CL. It's based on CLOS (so it is slow) but yesterday the author, @show-matz , gave a talk on it at Shibuya.lisp Lisp Meetup and I …
-
The main `crossbeam` crate is going to be an umbrella crate that brings together the most important pieces of the Crossbeam project together and reexports them. I've been thinking what should it look …
ghost updated
6 years ago
-
So far, there is Greedy and A* to solve the puzzle.
Would be nice to add further algorithms.
-
## DFS
- **깊이 우선 탐색**이라고도 부르며 그래프에서 **깊은 부분을 우선적으로 탐색하는 알고리즘**
- **스택 자료구조(혹은 재귀함수)를 이용**하며, 구체적인 동작 과정은 다음과 같음
1. 탐색 시작 노드를 스택에 삽입하고 방문 처리를 합니다.
2. 스택의 최상단 노드에 방문하지 않은 인접한 노드가 하나라도 있으면 그 노드를 …