- 博客(4)
- 收藏
- 关注
原创 leetcode - 133. Clone Graph
算法系列博客之DFS DFS(深度优先搜索)在图论的范畴里可以通俗的解释为 总是优先向相连接未访问的下一节点搜索,直到没有这样的节点即返回上一节点 DFS标准格式:Input: G = (V, E) is a Graphprocedure dfs(G): for all v∈V: visited(v) = false for all v∈V:
2017-03-18 18:56:24 281
原创 leetcode - 240.Search a 2D Matrix II
算法系列 — leetcode 题目描述: Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted in ascending from left to ri
2017-03-11 20:14:30 319
原创 leetcode-Divide and Conquer
算法系列之分治篇 选题:215. Kth Largest Element 4. Median of Two Sorted Arrays 这两题简单易解,但是均能通过分治的思想将算法复杂度优化215: Kth Largest Element in an ArrayFind the kth largest element in an unsorted array. Note that it is t
2017-03-05 16:37:01 346
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人