88
99_ Read this in other languages:_
1010[ _ English_ ] ( https://github.com/trekhleb/javascript-algorithms/ ) ,
11- [ 简体中文] ( https://github.com/trekhleb/javascript-algorithms/blob/master/ README.zh-CN.md)
11+ [ 简体中文] ( README.zh-CN.md )
1212
1313## 資料結構
1414
1515資料結構是一個電腦用來組織和排序資料的特定方式，透過這樣的方式資料可以有效率地被讀取以及修改。更精確地說，一個資料結構是一個資料值的集合、彼此間的關係，函數或者運作可以應用於資料上。
1616
17- * [ 鏈結串列] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/data-structures/linked-list)
18- * [ 貯列] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/data-structures/queue)
19- * [ 堆疊] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/data-structures/stack)
20- * [ 雜湊表] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/data-structures/hash-table)
21- * [ 堆] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/data-structures/heap)
22- * [ 優先貯列] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/data-structures/priority-queue)
23- * [ 字典樹] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/data-structures/trie)
24- * [ 樹] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/data-structures/tree)
25- * [ 二元搜尋樹] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/data-structures/tree/binary-search-tree)
26- * [ AVL樹] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/data-structures/tree/avl-tree)
27- * [ 紅黑樹] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/data-structures/tree/red-black-tree)
28- * [ 圖] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/data-structures/graph) (有向跟無向皆包含)
29- * [ 互斥集] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/data-structures/disjoint-set)
17+ * [ 鏈結串列] ( src/data-structures/linked-list )
18+ * [ 貯列] ( src/data-structures/queue )
19+ * [ 堆疊] ( src/data-structures/stack )
20+ * [ 雜湊表] ( src/data-structures/hash-table )
21+ * [ 堆] ( src/data-structures/heap )
22+ * [ 優先貯列] ( src/data-structures/priority-queue )
23+ * [ 字典樹] ( src/data-structures/trie )
24+ * [ 樹] ( src/data-structures/tree )
25+ * [ 二元搜尋樹] ( src/data-structures/tree/binary-search-tree )
26+ * [ AVL樹] ( src/data-structures/tree/avl-tree )
27+ * [ 紅黑樹] ( src/data-structures/tree/red-black-tree )
28+ * [ 圖] ( src/data-structures/graph ) (有向跟無向皆包含)
29+ * [ 互斥集] ( src/data-structures/disjoint-set )
3030
3131## 演算法
3232
@@ -35,99 +35,99 @@ _Read this in other languages:_
3535### 演算法議題分類
3636
3737* ** 數學類**
38- * [ 階層] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/math/factorial)
39- * [ 費伯納西數列] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/math/fibonacci)
40- * [ Primality Test] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/math/primality-test) (排除法)
41- * [ 歐幾里得算法] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/math/euclidean-algorithm) - 計算最大公因數 (GCD)
42- * [ 最小公倍數] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/math/least-common-multiple) (LCM)
43- * [ 整數拆分] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/math/integer-partition)
38+ * [ 階層] ( src/algorithms/math/factorial )
39+ * [ 費伯納西數列] ( src/algorithms/math/fibonacci )
40+ * [ Primality Test] ( src/algorithms/math/primality-test ) (排除法)
41+ * [ 歐幾里得算法] ( src/algorithms/math/euclidean-algorithm ) - 計算最大公因數 (GCD)
42+ * [ 最小公倍數] ( src/algorithms/math/least-common-multiple ) (LCM)
43+ * [ 整數拆分] ( src/algorithms/math/integer-partition )
4444* ** 集合**
45- * [ 笛卡爾積] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/cartesian-product) - 多個集合的乘積
46- * [ 冪集合] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/power-set) - 所有集合的子集合
47- * [ 排列] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/permutations) (有/無重複)
48- * [ 组合] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/combinations) (有/無重複)
49- * [ 洗牌算法] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/fisher-yates) - 隨機置換一有限序列
50- * [ 最長共同子序列] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/longest-common-subsequence) (LCS)
51- * [ 最長遞增子序列] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/longest-increasing-subsequence)
52- * [ Shortest Common Supersequence] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/shortest-common-supersequence) (SCS)
53- * [ 背包問題] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/knapsack-problem) - "0/1" and "Unbound" ones
54- * [ 最大子序列問題] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/maximum-subarray) - 暴力法以及動態編程的(Kadane's)版本
45+ * [ 笛卡爾積] ( src/algorithms/sets/cartesian-product ) - 多個集合的乘積
46+ * [ 冪集合] ( src/algorithms/sets/power-set ) - 所有集合的子集合
47+ * [ 排列] ( src/algorithms/sets/permutations ) (有/無重複)
48+ * [ 组合] ( src/algorithms/sets/combinations ) (有/無重複)
49+ * [ 洗牌算法] ( src/algorithms/sets/fisher-yates ) - 隨機置換一有限序列
50+ * [ 最長共同子序列] ( src/algorithms/sets/longest-common-subsequence ) (LCS)
51+ * [ 最長遞增子序列] ( src/algorithms/sets/longest-increasing-subsequence )
52+ * [ Shortest Common Supersequence] ( src/algorithms/sets/shortest-common-supersequence ) (SCS)
53+ * [ 背包問題] ( src/algorithms/sets/knapsack-problem ) - "0/1" and "Unbound" ones
54+ * [ 最大子序列問題] ( src/algorithms/sets/maximum-subarray ) - 暴力法以及動態編程的(Kadane's)版本
5555* ** 字串**
56- * [ 萊文斯坦距離] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/string/levenshtein-distance) - 兩序列間的最小編輯距離
57- * [ 漢明距離] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/string/hamming-distance) - number of positions at which the symbols are different
58- * [ KMP 演算法] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/string/knuth-morris-pratt) - 子字串搜尋
59- * [ Rabin Karp 演算法] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/string/rabin-karp) - 子字串搜尋
60- * [ 最長共通子序列] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/string/longest-common-substring)
56+ * [ 萊文斯坦距離] ( src/algorithms/string/levenshtein-distance ) - 兩序列間的最小編輯距離
57+ * [ 漢明距離] ( src/algorithms/string/hamming-distance ) - number of positions at which the symbols are different
58+ * [ KMP 演算法] ( src/algorithms/string/knuth-morris-pratt ) - 子字串搜尋
59+ * [ Rabin Karp 演算法] ( src/algorithms/string/rabin-karp ) - 子字串搜尋
60+ * [ 最長共通子序列] ( src/algorithms/string/longest-common-substring )
6161* ** 搜尋**
62- * [ 二元搜尋] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/search/binary-search)
62+ * [ 二元搜尋] ( src/algorithms/search/binary-search )
6363* ** 排序**
64- * [ 氣泡排序] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sorting/bubble-sort)
65- * [ 選擇排序] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sorting/selection-sort)
66- * [ 插入排序] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sorting/insertion-sort)
67- * [ 堆排序] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sorting/heap-sort)
68- * [ 合併排序] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sorting/merge-sort)
69- * [ 快速排序] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sorting/quick-sort)
70- * [ 希爾排序] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sorting/shell-sort)
64+ * [ 氣泡排序] ( src/algorithms/sorting/bubble-sort )
65+ * [ 選擇排序] ( src/algorithms/sorting/selection-sort )
66+ * [ 插入排序] ( src/algorithms/sorting/insertion-sort )
67+ * [ 堆排序] ( src/algorithms/sorting/heap-sort )
68+ * [ 合併排序] ( src/algorithms/sorting/merge-sort )
69+ * [ 快速排序] ( src/algorithms/sorting/quick-sort )
70+ * [ 希爾排序] ( src/algorithms/sorting/shell-sort )
7171* ** 樹**
72- * [ 深度優先搜尋] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/tree/depth-first-search) (DFS)
73- * [ 廣度優先搜尋] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/tree/breadth-first-search) (BFS)
72+ * [ 深度優先搜尋] ( src/algorithms/tree/depth-first-search ) (DFS)
73+ * [ 廣度優先搜尋] ( src/algorithms/tree/breadth-first-search ) (BFS)
7474* ** 圖**
75- * [ 深度優先搜尋] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/depth-first-search) (DFS)
76- * [ 廣度優先搜尋] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/breadth-first-search) (BFS)
77- * [ Dijkstra 演算法] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/dijkstra) - 找到所有圖頂點的最短路徑
78- * [ Bellman-Ford 演算法] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/bellman-ford) - 找到所有圖頂點的最短路徑
79- * [ Detect Cycle] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/detect-cycle) - for both directed and undirected graphs (DFS and Disjoint Set based versions)
80- * [ Prim’s 演算法] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/prim) - finding Minimum Spanning Tree (MST) for weighted undirected graph
81- * [ Kruskal’s 演算法] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/kruskal) - finding Minimum Spanning Tree (MST) for weighted undirected graph
82- * [ 拓撲排序] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/topological-sorting) - DFS method
83- * [ 關節點] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/articulation-points) - Tarjan's algorithm (DFS based)
84- * [ 橋] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/bridges) - DFS based algorithm
85- * [ 尤拉路徑及尤拉環] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/eulerian-path) - Fleury's algorithm - Visit every edge exactly once
86- * [ 漢彌爾頓環] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/hamiltonian-cycle) - Visit every vertex exactly once
87- * [ 強連通組件] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/strongly-connected-components) - Kosaraju's algorithm
88- * [ 旅行推銷員問題] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/travelling-salesman) - shortest possible route that visits each city and returns to the origin city
75+ * [ 深度優先搜尋] ( src/algorithms/graph/depth-first-search ) (DFS)
76+ * [ 廣度優先搜尋] ( src/algorithms/graph/breadth-first-search ) (BFS)
77+ * [ Dijkstra 演算法] ( src/algorithms/graph/dijkstra ) - 找到所有圖頂點的最短路徑
78+ * [ Bellman-Ford 演算法] ( src/algorithms/graph/bellman-ford ) - 找到所有圖頂點的最短路徑
79+ * [ Detect Cycle] ( src/algorithms/graph/detect-cycle ) - for both directed and undirected graphs (DFS and Disjoint Set based versions)
80+ * [ Prim’s 演算法] ( src/algorithms/graph/prim ) - finding Minimum Spanning Tree (MST) for weighted undirected graph
81+ * [ Kruskal’s 演算法] ( src/algorithms/graph/kruskal ) - finding Minimum Spanning Tree (MST) for weighted undirected graph
82+ * [ 拓撲排序] ( src/algorithms/graph/topological-sorting ) - DFS method
83+ * [ 關節點] ( src/algorithms/graph/articulation-points ) - Tarjan's algorithm (DFS based)
84+ * [ 橋] ( src/algorithms/graph/bridges ) - DFS based algorithm
85+ * [ 尤拉路徑及尤拉環] ( src/algorithms/graph/eulerian-path ) - Fleury's algorithm - Visit every edge exactly once
86+ * [ 漢彌爾頓環] ( src/algorithms/graph/hamiltonian-cycle ) - Visit every vertex exactly once
87+ * [ 強連通組件] ( src/algorithms/graph/strongly-connected-components ) - Kosaraju's algorithm
88+ * [ 旅行推銷員問題] ( src/algorithms/graph/travelling-salesman ) - shortest possible route that visits each city and returns to the origin city
8989* ** 未分類**
90- * [ 河內塔] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/uncategorized/hanoi-tower)
91- * [ N-皇后問題] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/uncategorized/n-queens)
92- * [ 騎士走棋盤] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/uncategorized/knight-tour)
90+ * [ 河內塔] ( src/algorithms/uncategorized/hanoi-tower )
91+ * [ N-皇后問題] ( src/algorithms/uncategorized/n-queens )
92+ * [ 騎士走棋盤] ( src/algorithms/uncategorized/knight-tour )
9393
9494### 演算法範型
9595
9696演算法的範型是一個泛用方法或設計一類底層演算法的方式。它是一個比演算法的概念更高階的抽象化，就像是演算法是比電腦程式更高階的抽象化。
9797
9898* ** 暴力法** - 尋遍所有的可能解然後選取最好的解
99- * [ 最大子序列] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/maximum-subarray)
100- * [ 旅行推銷員問題] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/travelling-salesman) - shortest possible route that visits each city and returns to the origin city
99+ * [ 最大子序列] ( src/algorithms/sets/maximum-subarray )
100+ * [ 旅行推銷員問題] ( src/algorithms/graph/travelling-salesman ) - shortest possible route that visits each city and returns to the origin city
101101* ** 貪婪法** - choose the best option at the current time, without any consideration for the future
102- * [ 未定背包問題] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/knapsack-problem)
103- * [ Dijkstra 演算法] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/dijkstra) - 找到所有圖頂點的最短路徑
104- * [ Prim’s 演算法] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/prim) - finding Minimum Spanning Tree (MST) for weighted undirected graph
105- * [ Kruskal’s 演算法] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/kruskal) - finding Minimum Spanning Tree (MST) for weighted undirected graph
102+ * [ 未定背包問題] ( src/algorithms/sets/knapsack-problem )
103+ * [ Dijkstra 演算法] ( src/algorithms/graph/dijkstra ) - 找到所有圖頂點的最短路徑
104+ * [ Prim’s 演算法] ( src/algorithms/graph/prim ) - finding Minimum Spanning Tree (MST) for weighted undirected graph
105+ * [ Kruskal’s 演算法] ( src/algorithms/graph/kruskal ) - finding Minimum Spanning Tree (MST) for weighted undirected graph
106106* ** 分治法** - divide the problem into smaller parts and then solve those parts
107- * [ 二元搜尋] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/search/binary-search)
108- * [ 河內塔] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/uncategorized/hanoi-tower)
109- * [ 歐幾里得演算法] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/math/euclidean-algorithm) - calculate the Greatest Common Divisor (GCD)
110- * [ 排列] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/permutations) (有/無重複)
111- * [ 组合] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/combinations) (有/無重複)
112- * [ 合併排序] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sorting/merge-sort)
113- * [ 快速排序] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sorting/quick-sort)
114- * [ 樹深度優先搜尋] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/tree/depth-first-search) (DFS)
115- * [ 圖深度優先搜尋] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/depth-first-search) (DFS)
107+ * [ 二元搜尋] ( src/algorithms/search/binary-search )
108+ * [ 河內塔] ( src/algorithms/uncategorized/hanoi-tower )
109+ * [ 歐幾里得演算法] ( src/algorithms/math/euclidean-algorithm ) - calculate the Greatest Common Divisor (GCD)
110+ * [ 排列] ( src/algorithms/sets/permutations ) (有/無重複)
111+ * [ 组合] ( src/algorithms/sets/combinations ) (有/無重複)
112+ * [ 合併排序] ( src/algorithms/sorting/merge-sort )
113+ * [ 快速排序] ( src/algorithms/sorting/quick-sort )
114+ * [ 樹深度優先搜尋] ( src/algorithms/tree/depth-first-search ) (DFS)
115+ * [ 圖深度優先搜尋] ( src/algorithms/graph/depth-first-search ) (DFS)
116116* ** 動態編程** - build up to a solution using previously found sub-solutions
117- * [ 費伯納西數列] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/math/fibonacci)
118- * [ 萊溫斯坦距離] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/string/levenshtein-distance) - minimum edit distance between two sequences
119- * [ 最長共同子序列] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/longest-common-subsequnce) (LCS)
120- * [ 最長共同子字串] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/string/longest-common-substring)
121- * [ 最長遞增子序列] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/longest-increasing-subsequence)
122- * [ 最短共同子序列] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/shortest-common-supersequence)
123- * [ 0/1背包問題] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/knapsack-problem)
124- * [ 整數拆分] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/math/integer-partition)
125- * [ 最大子序列] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/sets/maximum-subarray)
126- * [ Bellman-Ford 演算法] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/bellman-ford) - finding shortest path to all graph vertices
117+ * [ 費伯納西數列] ( src/algorithms/math/fibonacci )
118+ * [ 萊溫斯坦距離] ( src/algorithms/string/levenshtein-distance ) - minimum edit distance between two sequences
119+ * [ 最長共同子序列] ( src/algorithms/sets/longest-common-subsequnce ) (LCS)
120+ * [ 最長共同子字串] ( src/algorithms/string/longest-common-substring )
121+ * [ 最長遞增子序列] ( src/algorithms/sets/longest-increasing-subsequence )
122+ * [ 最短共同子序列] ( src/algorithms/sets/shortest-common-supersequence )
123+ * [ 0/1背包問題] ( src/algorithms/sets/knapsack-problem )
124+ * [ 整數拆分] ( src/algorithms/math/integer-partition )
125+ * [ 最大子序列] ( src/algorithms/sets/maximum-subarray )
126+ * [ Bellman-Ford 演算法] ( src/algorithms/graph/bellman-ford ) - finding shortest path to all graph vertices
127127* ** 回溯法** - 用類似暴力法來嘗試產生所有可能解，但每次只在能滿足所有測試條件，且只有繼續產生子序列方案來產生的解決方案。否則回溯並尋找不同路徑的解決方案。
128- * [ 漢彌爾頓迴路] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/graph/hamiltonian-cycle) - Visit every vertex exactly once
129- * [ N-皇后問題] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/uncategorized/n-queens)
130- * [ 騎士走棋盤] ( https://github.com/trekhleb/javascript-algorithms/tree/master/ src/algorithms/uncategorized/knight-tour)
128+ * [ 漢彌爾頓迴路] ( src/algorithms/graph/hamiltonian-cycle ) - Visit every vertex exactly once
129+ * [ N-皇后問題] ( src/algorithms/uncategorized/n-queens )
130+ * [ 騎士走棋盤] ( src/algorithms/uncategorized/knight-tour )
131131* ** Branch & Bound**
132132
133133## 如何使用本知識庫
0 commit comments