2016年1月28日
[LeetCode] Number of Connected Components in an Undirected Graph 无向图中的连通区域的个数
摘要： Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a function to find the number of connected 阅读全文
posted @ 2016-01-28 15:14 Grandyang 阅读(17489) 评论(2) 推荐(0)
[LeetCode] Patching Array 补丁数组
摘要： Given a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1, n] inclusive can be for 阅读全文
posted @ 2016-01-28 12:42 Grandyang 阅读(11046) 评论(11) 推荐(1)
Fork me on GitHub