<ruby id="bdb3f"></ruby>

    <p id="bdb3f"><cite id="bdb3f"></cite></p>

      <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
        <p id="bdb3f"><cite id="bdb3f"></cite></p>

          <pre id="bdb3f"></pre>
          <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

          <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
          <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

          <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                <ruby id="bdb3f"></ruby>

                ??碼云GVP開源項目 12k star Uniapp+ElementUI 功能強大 支持多語言、二開方便! 廣告
                # Content - 目錄 * [Content 目錄](SUMMARY.md) * [Preface 前言](docs/Preface/README.md) * [Chapter-1 Sort 第1章 排序](docs/Sort/README.md) * [InsertSort 插入排序](docs/Sort/InsertSort/README.md) * [BubbleSort 冒泡排序](docs/Sort/BubbleSort/README.md) * [QuickSort 快速排序](docs/Sort/QuickSort/README.md) * [MergeSort 歸并排序](docs/Sort/MergeSort/README.md) * [Chapter-2 Search 第2章 搜索](docs/Search/README.md) * [BinarySearch 二分查找法(折半查找法)](docs/Search/BinarySearch/README.md) * [BruteForce 暴力枚舉](docs/Search/BruteForce/README.md) * [Recursion 遞歸](docs/Search/Recursion/README.md) * [BreadthFirstSearch 廣度優先搜索](docs/Search/BreadthFirstSearch/README.md) * [BidirectionalBreadthSearch 雙向廣度搜索](docs/Search/BidirectionalBreadthSearch/README.md) * [AStarSearch A\*搜索](docs/Search/AStarSearch/README.md) * [DancingLink 舞蹈鏈](docs/Search/DancingLink/README.md) * [Chapter-3 DataStructure 第3章 數據結構](docs/DataStructure/README.md) * [DisjointSet 并查集](docs/DataStructure/DisjointSet/README.md) * [PrefixTree(TrieTree) 前綴樹](docs/DataStructure/PrefixTree/README.md) * [LeftistTree(LeftistHeap) 左偏樹(左偏堆)](docs/DataStructure/LeftistTree/README.md) * [SegmentTree 線段樹](docs/DataStructure/SegmentTree/README.md) * [FenwickTree(BinaryIndexedTree) 樹狀數組](docs/DataStructure/FenwickTree/README.md) * [BinarySearchTree 二叉查找樹](docs/DataStructure/BinarySearchTree/README.md) * [AVLTree AVL平衡樹](docs/DataStructure/AVLTree/README.md) * [RedBlackTree 紅黑樹](docs/DataStructure/RedBlackTree/README.md) * [Chapter-4 DynamicProgramming 第4章 動態規劃](docs/DynamicProgramming/README.md) * Section-1 LinearDP 第1節 線性動規 * [LongestCommonSubsequence 最長公共子序列](docs/DynamicProgramming/LinearDP/LongestCommonSubsequence/README.md) * [LongestIncreasingSubsequence 最長遞增子序列](docs/DynamicProgramming/LinearDP/LongestIncreasingSubsequence/README.md) * [LongestIncreasingSubsequenceExtension 最長遞增子序列擴展](docs/DynamicProgramming/LinearDP/LongestIncreasingSubsequenceExtension/README.md) * [BidirectionalSubsequence 雙向子序列](docs/DynamicProgramming/LinearDP/BidirectionalSubsequence/README.md) * Section-2 BagDP 第2節 背包問題 * [ZeroOneBag 01背包](docs/DynamicProgramming/BagDP/ZeroOneBag/README.md) * [CompleteBag 完全背包](docs/DynamicProgramming/BagDP/CompleteBag/README.md) * [TwoDimensionBag 二維背包](docs/DynamicProgramming/BagDP/TwoDimensionBag/README.md) * [GroupBag 分組背包](docs/DynamicProgramming/BagDP/GroupBag/README.md) * Section-3 RegionalDP 第3節 區域動規 * [MinimumMergeCost - 最小合并代價](docs/DynamicProgramming/RegionalDP/MinimumMergeCost/README.md) * [MinimumMergeCostExtension - 最小合并代價擴展](docs/DynamicProgramming/RegionalDP/MinimumMergeCostExtension/README.md) * [MaximumBinaryTreeMerge - 最大二叉樹合并](docs/DynamicProgramming/RegionalDP/MaximumBinaryTreeMerge/README.md) * Section-4 TreeDP 第4節 樹形動規 * [BinaryTreeDP 二叉樹動規](docs/DynamicProgramming/TreeDP/BinaryTreeDP/README.md) * [MultipleTreeDP 多叉樹動規](docs/DynamicProgramming/TreeDP/MultipleTreeDP/README.md) * [MultipleTreeDPExtension 多叉樹動規擴展](docs/DynamicProgramming/TreeDP/MultipleTreeDPExtension/README.md) * [LoopedMultipleTreeDP 帶環多叉樹動規](docs/DynamicProgramming/TreeDP/LoopedMultipleTreeDP/README.md) * [TraverseBinaryTreeDP 遍歷二叉樹動規](docs/DynamicProgramming/TreeDP/TraverseBinaryTreeDP/README.md) * [Chapter-5 GraphTheory 第5章 圖論](docs/GraphTheory/README.md) * Section-1 Traverse 第1節 遍歷 * [PreorderTraverse 先序遍歷](docs/GraphTheory/Traverse/PreorderTraverse/README.md) * [InorderTraverse 中序遍歷](docs/GraphTheory/Traverse/InorderTraverse/README.md) * [PostorderTraverse 后序遍歷](docs/GraphTheory/Traverse/PostorderTraverse/README.md) * [LevelorderTraverse 層序遍歷](docs/GraphTheory/Traverse/LevelorderTraverse/README.md) * [DepthFirstSearch 深度優先搜索](docs/GraphTheory/Traverse/DepthFirstSearch/README.md) * [BreadthFirstSearch 廣度優先搜索](docs/GraphTheory/Traverse/BreadthFirstSearch/README.md) * [TopologicalSort 拓撲排序](docs/GraphTheory/Traverse/TopologicalSort/README.md) * [EulerCycle 歐拉回路](docs/GraphTheory/Traverse/EulerCycle/README.md) * Section-2 MinimumSpanningTree 第2節 最小生成樹 * [Kruskal Kruskal算法](docs/GraphTheory/MinimumSpanningTree/Kruskal/README.md) * [Prim Prim算法](docs/GraphTheory/MinimumSpanningTree/Prim/README.md) * [SecondMinimumSpanningTree 次小生成樹](docs/GraphTheory/MinimumSpanningTree/SecondMinimumSpanningTree/README.md) * [OptimalRatioSpanningTree 最優比率生成樹](docs/GraphTheory/MinimumSpanningTree/OptimalRatioSpanningTree/README.md) * Section-3 ShortestPath 第3節 最短路徑 * [Relaxation 松弛操作](docs/GraphTheory/ShortestPath/Relaxation/README.md) * [BellmanFord BellmanFord算法](docs/GraphTheory/ShortestPath/BellmanFord/README.md) * [ShortestPathFasterAlgorithm 最短路徑更快算法(SPFA)](docs/GraphTheory/ShortestPath/ShortestPathFasterAlgorithm/README.md) * [Dijkstra Dijkstra算法](docs/GraphTheory/ShortestPath/Dijkstra/README.md) * [Floyd Floyd算法](docs/GraphTheory/ShortestPath/Floyd/README.md) * [DifferentConstraints 差分約束](docs/GraphTheory/ShortestPath/DifferentConstraints/README.md) * Section-4 Connectivity 第4節 連通 * [Kosaraju Kosaraju算法](docs/GraphTheory/Connectivity/Kosaraju/README.md) * [Tarjan Tarjan算法](docs/GraphTheory/Connectivity/Tarjan/README.md) * [Gabow - Gabow算法](docs/GraphTheory/Connectivity/Gabow/README.md) * [TwoSatisfiability 2-SAT問題](docs/GraphTheory/Connectivity/TwoSatisfiability/README.md) * [Cut 割](docs/GraphTheory/Connectivity/Cut/README.md) * [DoubleConnectedComponent 雙聯通分支](docs/GraphTheory/Connectivity/DoubleConnectedComponent/README.md) * [LeastCommonAncestor 最近公共祖先](docs/GraphTheory/Connectivity/LeastCommonAncestor/README.md) * [RangeExtremumQuery 區域最值查詢](docs/GraphTheory/Connectivity/RangeExtremumQuery/README.md) * Section-5 FlowNetwork 第5節 網絡流 * [EdmondsKarp EdmondsKarp算法](docs/GraphTheory/FlowNetwork/EdmondsKarp/README.md) * [PushAndRelabel 壓入與重標記](docs/GraphTheory/FlowNetwork/PushAndRelabel/README.md) * [Dinic Dinic算法](docs/GraphTheory/FlowNetwork/Dinic/README.md) * [DistanceLabel 距離標號算法](docs/GraphTheory/FlowNetwork/DistanceLabel/README.md) * [RelabelToFront 重標記與前移算法](docs/GraphTheory/FlowNetwork/RelabelToFront/README.md) * [HighestLabelPreflowPush 最高標號預留與推進算法](docs/GraphTheory/FlowNetwork/HighestLabelPreflowPush/README.md) * [DistanceLabel-AdjacentListVersion 距離標號算法-鄰接表優化版](docs/GraphTheory/FlowNetwork/DistanceLabel-AdjacentListVersion/README.md) * [Summary-Maxflow 最大流算法小結](docs/GraphTheory/FlowNetwork/Summary-Maxflow/README.md) * [MinimumCost-Maxflow 最小費用最大流](docs/GraphTheory/FlowNetwork/MinimumCost-Maxflow/README.md) * [MultipleSourceMultipleSink-Maxflow 多源點、多匯點的最大流](docs/GraphTheory/FlowNetwork/MultipleSourceMultipleSink-Maxflow/README.md) * [Connectivity 連通度](docs/GraphTheory/FlowNetwork/Connectivity/README.md) * [NoSourceNoSink-VolumeBoundedFlow 無源點、無匯點、容量有上下界的流網絡](docs/GraphTheory/FlowNetwork/NoSourceNoSink-VolumeBoundedFlow/README.md) * [VolumeBounded-Maxflow 容量有上下界的最大流](docs/GraphTheory/FlowNetwork/VolumeBounded-Maxflow/README.md) * [VolumeBounded-Minflow 容量有上下界的最小流](docs/GraphTheory/FlowNetwork/VolumeBounded-Minflow/README.md) * Section-6 BinaryMatch 第6節 二分匹配 * [Hungarian 匈牙利算法](docs/GraphTheory/BinaryMatch/Hungarian/README.md) * [HopcroftKarp Hopcroft-Karp算法](docs/GraphTheory/BinaryMatch/HopcroftKarp/README.md) * [MatchToMaxflow 二分匹配轉化為最大流](docs/GraphTheory/BinaryMatch/MatchToMaxflow/README.md) * [KuhnMunkres Kuhn-Munkres算法](docs/GraphTheory/BinaryMatch/KuhnMunkres/README.md) * [Introduction-Domination,Independent,Covering,Clique 介紹支配集、獨立集、覆蓋集和團](docs/GraphTheory/BinaryMatch/Introduction-Domination_Independent_Covering_Clique/README.md) * [WeightedCoveringAndIndependentSet 最小點權覆蓋和最大點權獨立集](docs/GraphTheory/BinaryMatch/WeightedCoveringAndIndependentSet/README.md) * [MinimumDisjointPathCovering 最小不相交路徑覆蓋](docs/GraphTheory/BinaryMatch/MinimumDisjointPathCovering/README.md) * [MinimumJointPathCovering 最小可相交路徑覆蓋](docs/GraphTheory/BinaryMatch/MinimumJointPathCovering/README.md) * [Coloring 染色問題](docs/GraphTheory/BinaryMatch/Coloring/README.md) * [Chapter-6 Calculation 第6章 計算](docs/Calculation/README.md) * [LargeNumber 大數字](docs/Calculation/LargeNumber/README.md) * [Exponentiation 求冪運算](docs/Calculation/Exponentiation/README.md) * [Chapter-7 CombinatorialMathematics 第7章 組合數學](docs/CombinatorialMathematics/README.md) * [FullPermutation 全排列](docs/CombinatorialMathematics/FullPermutation/README.md) * [UniqueFullPermutation 唯一的全排列](docs/CombinatorialMathematics/UniqueFullPermutation/README.md) * [Combination 組合](docs/CombinatorialMathematics/Combination/README.md) * [DuplicableCombination (元素)可重復的組合](docs/CombinatorialMathematics/DuplicableCombination/README.md) * [Subset 子集](docs/CombinatorialMathematics/Subset/README.md) * [UniqueSubset 唯一的子集](docs/CombinatorialMathematics/UniqueSubset/README.md) * [Permutation 排列](docs/CombinatorialMathematics/Permutation/README.md) * [PermutationGroup 置換群](docs/CombinatorialMathematics/PermutationGroup/README.md) * [Catalan 卡特蘭數](docs/CombinatorialMathematics/Catalan/README.md) * [Chapter-8 NumberTheory 第8章 數論](docs/NumberTheory/README.md) * [Sieve 篩選算法](docs/NumberTheory/Sieve/README.md) * [Euclid 歐幾里得](docs/NumberTheory/Euclid/README.md) * [EuclidExtension 歐幾里得擴展](docs/NumberTheory/EuclidExtension/README.md) * [ModularLinearEquation 模線性方程](docs/NumberTheory/ModularLinearEquation/README.md) * [ChineseRemainerTheorem 中國剩余定理](docs/NumberTheory/ChineseRemainerTheorem/README.md) * [ModularExponentiation 模冪運算](docs/NumberTheory/ModularExponentiation/README.md) * [Chapter-9 LinearAlgebra 第9章 線性代數](docs/LinearAlgebra/README.md) * Section-1 Matrix 第1節 矩陣 * [Strassen Strassen算法](docs/LinearAlgebra/Matrix/Strassen/README.md) * [GaussElimination 高斯消元法](docs/LinearAlgebra/Matrix/GaussElimination/README.md) * [LUP LUP分解](docs/LinearAlgebra/Matrix/LUP/README.md) * [InverseMatrix 矩陣求逆](docs/LinearAlgebra/Matrix/InverseMatrix/README.md) * Section-2 LinearProgramming 第2節 線性規劃 * [Simplex 單純形算法](docs/LinearAlgebra/LinearProgramming/Simplex/README.md) * [Dinkelback Dinkelback算法](docs/LinearAlgebra/LinearProgramming/Dinkelback/README.md) * [Chapter-10 AnalyticGeometry 第10章 解析幾何](docs/AnalyticGeometry/README.md) * Section-1 Polygon 第1節 多邊形 * [Cross 叉積](docs/AnalyticGeometry/Polygon/Cross/README.md) * [SegmentIntersection 線段相交](docs/AnalyticGeometry/Polygon/SegmentIntersection/README.md) * [Sweeping 掃除算法](docs/AnalyticGeometry/Polygon/Sweeping/README.md) * [ConvexPolygonArea 凸多邊形面積](docs/AnalyticGeometry/Polygon/ConvexPolygonArea/README.md) * [ConvexPolygonGravityCenter 凸多邊形重心](docs/AnalyticGeometry/Polygon/ConvexPolygonGravityCenter/README.md) * [RayDistinguish 射線判別](docs/AnalyticGeometry/Polygon/RayDistinguish/README.md) * [RotatingCalipers 旋轉卡殼](docs/AnalyticGeometry/Polygon/RotatingCalipers/README.md) * Section-2 ConvexHull 第2節 凸包 * [NearestNeighbor 最近點對](docs/AnalyticGeometry/ConvexHull/NearestNeighbor/README.md) * [GrahamScan Graham掃描算法](docs/AnalyticGeometry/ConvexHull/GrahamScan/README.md) * [QuickConvexHull 快速凸包算法](docs/AnalyticGeometry/ConvexHull/QuickConvexHull/README.md) * [Chapter-11 TextMatch 第11章 文本匹配](docs/TextMatch/README.md) * [SimpleMatch 簡單匹配](docs/TextMatch/SimpleMatch/README.md) * [AhoCorasickAutomata AC自動機](docs/TextMatch/AhoCorasickAutomata/README.md) * [KnuthMorrisPratt KMP匹配算法](docs/TextMatch/KnuthMorrisPratt/README.md) * [RabinKarp RabinKarp算法](docs/TextMatch/RabinKarp/README.md) * [BoyerMoore BoyerMoore算法](docs/TextMatch/BoyerMoore/README.md) * [Chapter-12 GameTheory 第12章 博弈論](docs/GameTheory/README.md) * [BashGame 巴什博弈](docs/GameTheory/BashGame/README.md) * [WythoffGame 威佐夫博弈](docs/GameTheory/WythoffGame/README.md) * [NimGame 尼姆博弈](docs/GameTheory/NimGame/README.md)
                  <ruby id="bdb3f"></ruby>

                  <p id="bdb3f"><cite id="bdb3f"></cite></p>

                    <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
                      <p id="bdb3f"><cite id="bdb3f"></cite></p>

                        <pre id="bdb3f"></pre>
                        <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

                        <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
                        <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

                        <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                              <ruby id="bdb3f"></ruby>

                              哎呀哎呀视频在线观看