- 博客(2)
- 收藏
- 关注
RSS订阅原创 DFS 和 BFS 的原理
DFS 的原理： 1. 你要明白DFS 这个function究竟在干嘛：是node u is unvisited, visit all nodes that are reachable from node u. *Node v is reachable from node u if there is a path (u...v) and all nodes of the path are unv
2015-08-07 12:28:35
286
原创 Binary Search
注意是return first, last 还是 any. For a given sorted array (ascending order) and a target number, find the first index of this number in O(log n) time complexity. If the target number does not exis
2015-07-31 02:47:48
124
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人