2017年6月14日

Course Schedule II
摘要： The same as I: 阅读全文
posted @ 2017-06-14 08:50 codingEskimo 阅读(71) 评论(0) 推荐(0) 编辑
Course Schedule
摘要： Note: 1) For integer node 0~n, we don't need a hashmap, we can just use array to act like a map; 2) How to initial List[] is very important 3) We need 阅读全文
posted @ 2017-06-14 08:38 codingEskimo 阅读(114) 评论(0) 推荐(0) 编辑
Topological Sorting
摘要： Topological Sorting is very important, almost every company has a question related to it. Goal: To find an proper order making the front nodes are ind 阅读全文
posted @ 2017-06-14 06:52 codingEskimo 阅读(165) 评论(0) 推荐(0) 编辑
Search Graph Nodes
摘要： Note: BSF: if it needs to check the value, should check it when it is coming from Queue. The logic is most clear to do it there. This question is to a 阅读全文
posted @ 2017-06-14 06:06 codingEskimo 阅读(177) 评论(0) 推荐(0) 编辑

导航