Graph
文章平均质量分 80
nicaishibiantai
这个作者很懒,什么都没留下…
展开
-
Word Ladder
public int ladderLength(String start, String end, Set dict) { int level = 1; Set visited = new HashSet(); Queue queue = new LinkedList(); queue.add(start); visi原创 2014-09-22 07:01:47 · 407 阅读 · 0 评论 -
Lintcode - Topological Sorting
Thoughts:1. For each node in the graph, construct a map with node as key, and number of parent nodes as value2. Looping through left nodes and see if its indegree is 0: if so, remove the node from原创 2015-01-28 14:56:22 · 2359 阅读 · 0 评论 -
Clone Graph
public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) { if (node == null) { return null; } Map map = new HashMap(); UndirectedGraphNode newNode =原创 2014-09-02 12:47:48 · 421 阅读 · 0 评论 -
Course Schedule
There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as原创 2015-05-11 13:12:18 · 605 阅读 · 0 评论 -
Course schedule II
和course schedule一样的要求,只是要求输出toplogicl排序的结果。一个tricky的地方就是如果没有正常结果,输出new int[0public class Solution { public int[] findOrder(int numCourses, int[][] prerequisites) { int[] result = new int原创 2015-05-18 06:13:47 · 512 阅读 · 0 评论