Challenge-programming-contest:挑战程序设计竞赛2算法和数据结构pdf及源码-源码程序

[{"title":"（ 68 个子文件 41.10MB ） Challenge-programming-contest:挑战程序设计竞赛2算法和数据结构pdf及源码-源码程序","children":[{"title":"Challenge-programming-contest-master","children":[{"title":"挑战程序设计竞赛2 算法和数据结构.pdf <span style='color:#111;'> 55.56MB </span>","children":null,"spread":false},{"title":"源码","children":[{"title":"第7章","children":[{"title":"Merge Sort.cpp <span style='color:#111;'> 1.13KB </span>","children":null,"spread":false},{"title":"Minimum Cost Sort.cpp <span style='color:#111;'> 1.19KB </span>","children":null,"spread":false},{"title":"The Number of Inversions.cpp <span style='color:#111;'> 1.08KB </span>","children":null,"spread":false},{"title":"Quick Sort.cpp <span style='color:#111;'> 725B </span>","children":null,"spread":false},{"title":"Partition.cpp <span style='color:#111;'> 725B </span>","children":null,"spread":false},{"title":"Counting Sort.cpp <span style='color:#111;'> 790B </span>","children":null,"spread":false}],"spread":true},{"title":"第16章","children":[{"title":"模板.cpp <span style='color:#111;'> 6.56KB </span>","children":null,"spread":false},{"title":"Segment Intersections Manhattan Geometry.cpp <span style='color:#111;'> 3.00KB </span>","children":null,"spread":false}],"spread":true},{"title":"第19章","children":[{"title":"15 Puzzle1.cpp <span style='color:#111;'> 2.50KB </span>","children":null,"spread":false},{"title":"8 Puzzle.cpp <span style='color:#111;'> 1.68KB </span>","children":null,"spread":false},{"title":"15 Puzzle2.cpp <span style='color:#111;'> 2.46KB </span>","children":null,"spread":false},{"title":"8 Queens Problem.cpp <span style='color:#111;'> 1.47KB </span>","children":null,"spread":false}],"spread":true},{"title":"第11章","children":[{"title":"Fibonacci Number.cpp <span style='color:#111;'> 244B </span>","children":null,"spread":false},{"title":"Matrix Chain Multiplication.cpp <span style='color:#111;'> 683B </span>","children":null,"spread":false},{"title":"Longest Common Subsequence.cpp <span style='color:#111;'> 781B </span>","children":null,"spread":false}],"spread":true},{"title":"第15章","children":[{"title":"Minimum Spanning Tree.cpp <span style='color:#111;'> 2.10KB </span>","children":null,"spread":false},{"title":"Diameter of a Tree.cpp <span style='color:#111;'> 1.47KB </span>","children":null,"spread":false},{"title":"All Pairs Shortest Path.cpp <span style='color:#111;'> 1.35KB </span>","children":null,"spread":false},{"title":"Articulation Points.cpp <span style='color:#111;'> 1.47KB </span>","children":null,"spread":false},{"title":"Topological Sort.cpp <span style='color:#111;'> 1.26KB </span>","children":null,"spread":false}],"spread":true},{"title":"第17章","children":[{"title":"0-1 Knapsack Problem .cpp <span style='color:#111;'> 689B </span>","children":null,"spread":false},{"title":"Coin Changing Problem.cpp <span style='color:#111;'> 495B </span>","children":null,"spread":false},{"title":"Largest Rectangle.cpp <span style='color:#111;'> 2.17KB </span>","children":null,"spread":false},{"title":"Longest Increasing Subsequence .cpp <span style='color:#111;'> 665B </span>","children":null,"spread":false},{"title":"Largest Square.cpp <span style='color:#111;'> 981B </span>","children":null,"spread":false}],"spread":true},{"title":"第4章","children":[{"title":"Stack1.cpp <span style='color:#111;'> 1.07KB </span>","children":null,"spread":false},{"title":"Doubly Linked List1.cpp <span style='color:#111;'> 2.15KB </span>","children":null,"spread":false},{"title":"Queue1.cpp <span style='color:#111;'> 1.45KB </span>","children":null,"spread":false},{"title":"Doubly Linked List2.cpp <span style='color:#111;'> 1.12KB </span>","children":null,"spread":false},{"title":"Queue2.cpp <span style='color:#111;'> 1008B </span>","children":null,"spread":false},{"title":"Stack2.cpp <span style='color:#111;'> 915B </span>","children":null,"spread":false},{"title":"Areas on the Cross-Section Diagram.cpp <span style='color:#111;'> 1.05KB </span>","children":null,"spread":false}],"spread":true},{"title":"第12章","children":[{"title":"Graph.cpp <span style='color:#111;'> 535B </span>","children":null,"spread":false},{"title":"Connected Components.cpp <span style='color:#111;'> 1.19KB </span>","children":null,"spread":false},{"title":"Breadth First Search.cpp <span style='color:#111;'> 1.01KB </span>","children":null,"spread":false},{"title":"Depth First Search.cpp <span style='color:#111;'> 908B </span>","children":null,"spread":false}],"spread":true},{"title":"第10章","children":[{"title":"Maximum Heap.cpp <span style='color:#111;'> 823B </span>","children":null,"spread":false},{"title":"Priority Queue.cpp <span style='color:#111;'> 1.19KB </span>","children":null,"spread":false},{"title":"Complete Binary Tree.cpp <span style='color:#111;'> 725B </span>","children":null,"spread":false}],"spread":true},{"title":"第5章","children":[{"title":"Binary Search2.cpp <span style='color:#111;'> 437B </span>","children":null,"spread":false},{"title":"Linear Search.cpp <span style='color:#111;'> 729B </span>","children":null,"spread":false},{"title":"Dictionary.cpp <span style='color:#111;'> 1.73KB </span>","children":null,"spread":false},{"title":"Binary Search1.cpp <span style='color:#111;'> 748B </span>","children":null,"spread":false},{"title":"Allocation.cpp <span style='color:#111;'> 1.15KB </span>","children":null,"spread":false}],"spread":true},{"title":"第13章","children":[{"title":"Single Source Shortest Path I.cpp <span style='color:#111;'> 1.36KB </span>","children":null,"spread":false},{"title":"Minimum Spanning Tree.cpp <span style='color:#111;'> 1.46KB </span>","children":null,"spread":false},{"title":"Single Source Shortest Path II.cpp <span style='color:#111;'> 1.51KB </span>","children":null,"spread":false}],"spread":true},{"title":"第14章","children":[{"title":"Disjoint Set Union Find Tree.cpp <span style='color:#111;'> 1.36KB </span>","children":null,"spread":false},{"title":"Range Search (kD Tree).cpp <span style='color:#111;'> 2.25KB </span>","children":null,"spread":false}],"spread":false},{"title":"第9章","children":[{"title":"Binary Search Tree I.cpp <span style='color:#111;'> 1.55KB </span>","children":null,"spread":false},{"title":"Binary Search Tree II.cpp <span style='color:#111;'> 2.00KB </span>","children":null,"spread":false},{"title":"Binary Search Tree III.cpp <span style='color:#111;'> 3.16KB </span>","children":null,"spread":false}],"spread":false},{"title":"第6章","children":[{"title":"Koch Curve.cpp <span style='color:#111;'> 1.08KB </span>","children":null,"spread":false},{"title":"Exhaustive Search.cpp <span style='color:#111;'> 698B </span>","children":null,"spread":false}],"spread":false},{"title":"第2章","children":[{"title":"Maximum Profit.cpp <span style='color:#111;'> 433B </span>","children":null,"spread":false}],"spread":false},{"title":"第3章","children":[{"title":"Selection Sort.cpp <span style='color:#111;'> 672B </span>","children":null,"spread":false},{"title":"Bubble Sort.cpp <span style='color:#111;'> 783B </span>","children":null,"spread":false},{"title":"Shell Sort.cpp <span style='color:#111;'> 1.06KB </span>","children":null,"spread":false},{"title":"Stable Sort.cpp <span style='color:#111;'> 1.81KB </span>","children":null,"spread":false},{"title":"Insertion Sort.cpp <span style='color:#111;'> 783B </span>","children":null,"spread":false}],"spread":false},{"title":"第18章","children":[{"title":"Prime Numbers.cpp <span style='color:#111;'> 506B </span>","children":null,"spread":false},{"title":"Power.cpp <span style='color:#111;'> 411B </span>","children":null,"spread":false},{"title":"Greatest Common Divisor.cpp <span style='color:#111;'> 223B </span>","children":null,"spread":false}],"spread":false},{"title":"第8章","children":[{"title":"Reconstruction of a Tree.cpp <span style='color:#111;'> 967B </span>","children":null,"spread":false},{"title":"Binary Trees.cpp <span style='color:#111;'> 2.05KB </span>","children":null,"spread":false},{"title":"Tree Walk.cpp <span style='color:#111;'> 1.36KB </span>","children":null,"spread":false},{"title":"Rooted Trees.cpp <span style='color:#111;'> 1.94KB </span>","children":null,"spread":false}],"spread":false}],"spread":false}],"spread":true}],"spread":true}]