Source:
Reference:
[1] Hu, who, once Lei. Algorithm notes [M]. Machinery Industry Press .2016.7
Outline:
- Basic data structures:
- Linear table: stacks, queues, linked lists, order table
- Tree: binary tree traversal and build , complete binary tree , binary search tree , balanced binary tree , heap , Huffman tree
- FIG: FIG storage and traversing
- Classic advanced algorithms:
- Depth-first search, breadth advantages of searching, backtracking pruning
- Greedy, disjoint-set , hash map
- The shortest path (only an inspection tour of a single source), topological sorting (18 September for the first time the concepts involved, had not formally test), the critical path (not test too)
- Analog solving complex practical problems
- Simulation title
Catalogue:
- PAT A1155 Heap Paths (30 points) [complete binary tree] [] [stack depth-first search]
- PAT A1154 Vertex Coloring (25 min) [FIG storage and traversing the hash map] []
- PAT A1153 Decode Registration Card of PAT ( 25 minutes) [Title] analog
- PAT A1152 Google Recruitment (20 minutes) [prime]
- PAT A1151 LCA in a Binary Tree ( 30 minutes) [binary tree traversal of a binary tree []]
- PAT A1150 Travelling Salesman Problem (25 minutes) [FIG storage and traversing]
- PAT A1149 Dangerous Goods Packaging (25 points) [hash map]
- PAT A1148 Werewolf - Simple Version (20 points) [simulation questions]
- PAT A1147 Heaps (30 minutes) [] [heap binary tree traversal]
- PAT A1146 Topological Order (25 minutes) [FIG storage and traversing topological sorting []]
- PAT A1145 Hashing - Average Search Time ( 25 points) [hash map]
- PAT A1144 The Missing Number (20 points) [hash map]
- PAT A1143 Lowest Common Ancestor (30 points) [] [binary search tree binary tree traversal of a binary tree] []
- PAT A1142 Maximal Clique (25 minutes) [FIG storage and traversing]
- PAT A1141 PAT Ranking of Institutions (25 minutes) [Title] analog
- PAT A1140 Look-and-say Sequence (20 minutes) [Title] analog
- PAT A1138 Postorder Traversal (25 points) [binary tree traversal]
- PAT A1137 Final Grading (25 points) [simulation questions]
- PAT A1136 A Delayed Palindrome (20 minutes) [Title] analog
- PAT A1135 Is It A Red-Black Tree (30 points) [binary search tree]
- PAT A1134 Vertex Cover (25 minutes) [FIG storage and traversing]
- PAT A1133 Splitting A Linked List (25 points) [list] [hash map]
- PAT A1132 Cut Integer (20 points) [simulation questions]
- PAT A1129 Recommendation System (25 points) [simulation questions]
- PAT A1128 N Queens Puzzle (20 minutes) [Title] analog
- PAT A1127 ZigZagging on a Tree (30 minutes) [binary tree traversal of a binary tree []]
- PAT A1126 Eulerian Path (25 minutes) [FIG storage and traversing]
- PAT A1125 Chain the Ropes (25 minutes) [] [greedy] Huffman
- PAT A1123 Is It a Complete AVL Tree (30 minutes) [] [balanced binary tree complete binary tree traversal of a binary tree []]
- PAT A1122 Hamiltonian Cycle (25 min) [FIG storage and traversing]
- PAT A1120 Friend Numbers (20 points) [simulation questions]
- PAT A1119 Pre- and Post-order Traversals (30 points) [establish] a binary tree
- PAT A1118 Birds in Forest (25 points) [disjoint-set]
- PAT A1116 Come on! Let's C (20 minutes) [prime]
- PAT A1115 Counting Nodes in a BST ( 30 points) [binary search tree]
- PAT A1114 Family Property (25 points) [disjoint-set]
- PAT A1113 Integer Set Partition (25 points) [simulation questions]
- PAT A1111 Online Map (30 points) [Shortest Path]
- PAT A1110 Complete Binary Tree (25 points) [complete binary tree]
- PAT A1109 Group Photo (25 minutes) [Title] analog
- PAT A1108 Finding Average (20 minutes) [String Processing]
- PAT A1107 Social Clusters (30 minutes) [disjoint-set]
- PAT A1106 Lowest Price in Supply Chain ( 25 points) [establish] and binary tree traversal
- PAT A1105 Spiral Matrix (25 points) [simulation questions]
- PAT A1099 Build A Binary Search Tree ( 30 points) [establish] [binary tree binary tree traversal binary search tree] []
- PAT A1098 Insertion or Heap Sort (25 min) [insert] [heap sort]
- PAT A1094 The Largest Generation (25 points) [establish] and binary tree traversal
- PAT A1090 Highest Price in Supply Chain ( 25 points) [establish] and binary tree traversal
- PAT A1087 All Roads Lead to Rome ( 30 minutes) [] the shortest path
- PAT A1079 Total Sales of Supply Chain ( 25 min) [and establish binary tree traversal]
- PAT A1078 Hashing (25 points) [hash map] [prime]
- PAT A1076 Forwards on Weibo (30 minutes) [FIG storage and breadth-first search traversal] []
- PAT A1072 Gas Station (30 minutes) [] the shortest path
- PAT A1066 Root of AVL Tree (25 minutes) [balanced binary tree]
- PAT A1064 Complete Binary Search Tree (30 points) [] [complete binary tree binary search tree binary tree traversal] []
- PAT A1053 Path of Equal Weight (30 minutes) [establish and binary tree traversal]
- PAT A1043 Is It a Binary Search Tree (25 points) [] [binary search tree binary tree traversal of a binary tree] []
- PAT A1034 Head of a Gang (30 minutes) [FIG storage and depth-first search traversal] []
- PAT A1030 Travel Plan (30 minutes) [] the shortest path
- PAT A1021 Deepest Root (25 minutes) [FIG storage and depth-first search traversal] []
- PAT A1018 Public Bike Management (30 minutes) [] the shortest path
- PAT A1015 Reversible Primes (20 minutes) [conversion] [hex] primes
- PAT A1013 Battle Over Cities (25 minutes) [FIG storage and traversing]
- PAT A1004 Counting Leaves (30 points) [establish] and binary tree traversal
- PAT A1003 Emergency (25 minutes) [] the shortest path
Reproduced in: https: //www.cnblogs.com/blue-lin/p/10940646.html