a

Author: githubnotes

CF/gp/gp1.md

@@ -5,11 +5,6 @@
 ## merge lists
     - 156. Merge Intervals
 
-
-
-
-
-
 # Subarray
 Sum(i~j) = PrefixSum[j + 1] - PrefixSum[i]
 ## Winodw sum
@@ -24,25 +19,6 @@ Sum(i~j) = PrefixSum[j + 1] - PrefixSum[i]
     - 628. Maximum Subtree
 
 
-
-
-
-# others
-## Window Sum
-    - 604. window sum
-## topo sort
-    - course schedule/II
-## graph
-    - clone graph
-## list
-    - copy copyRandomList
-## sorting
-    - High Five
-    - Log Sorting
-## others
-    - K Closest
-
-
 # String
 ## Hash 字符/字符串统计类问题
     - 646. First Position Unique Character
@@ -62,7 +38,6 @@ Sum(i~j) = PrefixSum[j + 1] - PrefixSum[i]
     - 415. Valid Palindrome
 
 
-
 # BFS类问题
 - 二叉树上的宽搜 BFS in Binary Tree
 - 图上的宽搜 BFS in Graph
@@ -93,5 +68,29 @@ Sum(i~j) = PrefixSum[j + 1] - PrefixSum[i]
         - mapping old node to new node
         - conncet all edges (copy neighbors)
     - Graph Valid Tree
-## Minimum Spanning Tree
+## Topological Sorting (Directed)
+    - Topological Sorting
+        - collect in-degree 找到所有的 indegree
+        - put all nodes that indgree == 0 into queue
+        - bfs
+    - Course Schedule I && II (to-do)
+    - Sequence Reconstruction (to-do)
+## Minimum Spanning Tree (kruskal & Union Find Sets)
     - 589. Connecting Graph
+
+
+
+# others
+## Window Sum
+    - 604. window sum
+## topo sort
+    - course schedule/II
+## graph
+    - clone graph
+## list
+    - copy copyRandomList
+## sorting
+    - High Five
+    - Log Sorting
+## others
+    - K Closest