前言 配合《算法笔记》练习,《笔记》涵盖甲级前117题,个人对《笔记》进行扩充总结。 题目类型以《笔记》章节知识进行分类 PAT代码已经放在github上,大家可以自行下载对照:记得start&fork一下 PAT甲级1108-1155索引 题目类型1108 Finding Average简单模拟+字符串处理1109 Group Photo简单模拟1110 Complete Binary Tree完全二叉树1111 Online Map最短路径1112 Stucked Keyboard字符串处理1113 Integer Set Partition简单数学(水题)1114 Family Property并查集+中级模拟1115 Counting Nodes in a BST二叉树的基本操作1116 Come on! Let’s C素数+散列(水题)1117 Eddington Number简单模拟+散列(仔细理解)1118 Birds in Forest并查集1119 Pre- and Post-order Traversals树的遍历+树的重构(复杂)1120 Friend NumbersSTL(水题)1121 Damn Single散列(水题)1122 Hamiltonian Cycle图的基本操作(访问)1123 Is It a Complete AVL Tree构造平衡二叉树+完全二叉树判断1124 Raffle for Weibo Followers散列+STL1125 Chain the Ropes贪心法1126 Eulerian Path图的遍历1127 ZigZagging on a Tree树的遍历+树的重构+STL容器1128 N Queens Puzzle散列+N皇后问题1129 Recommendation SystemSTL+结构体运算符重载1130 Infix Expression树的遍历+中级模拟1131 Subway Map图的遍历+中级模拟(较难)1132 Cut Integer字符串处理(水题)1133 Splitting A Linked List链表1134 Vertex Cover图的访问+STL+散列1135 Is It A Red-Black Tree树的遍历(仔细理解)1136 A Delayed Palindrome字符串处理+大数运算1137 Final Grading简单模拟1138 Postorder Traversal树的遍历+树的重构1139 First Contact中级模拟1140 Look-and-say Sequence字符串处理1141 PAT Ranking of Institutions中级模拟1142 Maximal Clique图的存储+散列1143 Lowest Common Ancestor二叉排序树的性质(仔细理解)1144 The Missing Number散列(水题)1145 Hashing - Average Search Time散列(仔细理解)1146 Topological Order拓扑排序1147 Heaps完全二叉树的性质+静态存储1148 Werewolf - Simple Version模拟+暴力枚举(仔细理解)1149 Dangerous Goods PackagingSTL+模拟(水题)1150 Travelling Salesman Problem图的访问1151 LCA in a Binary Tree树的遍历(仔细理解)1152 Google Recruitment字符串处理+素数判断(水题)1153 Decode Registration Card of PAT模拟+字符串处理+排序1154 Vertex Coloring图的存储与访问1155 Heap Paths堆+完全二叉树