PAT (Advanced Level) Practice 题目链接 答案链接1001 A+B Format (20 分)数值问题+栈的应用1002 A+B for Polynomials (25 分)链表的应用1003 Emergency (25 分)最短路径+dijkstra的应用1004 Counting Leaves (30 分)层次遍历1005 Spell It Right (20 分)数值转字符1006 Sign In and Sign Out (25 分)最大与最小1007 Maximum Subsequence Sum (25 分)最大子序列和+动态规划1008 Elevator (20 分)模拟+遍历1009 Product of Polynomials (25 分)多项式乘积 1010 Radix (25 分)二分查找1011 World Cup Betting (20 分)选最大1012 The Best Rank (25 分)计数排序1013 Battle Over Cities (25 分)dfs+连通分量1014 Waiting in Line (30 分)离散事件模拟1015 Reversible Primes (20 分)数值处理+质数1016 Phone Bills (25 分)排序+集合+求和+STL1017 Queueing at Bank (25 分)离散事件模拟1018 Public Bike Management (30 分)图的dfs应用1019 General Palindromic Number (20 分)数值1020 Tree Traversals (25 分)中后序转层次遍历1021 Deepest Root (25 分)BFS或DFS1022 Digital Library (30 分)排序+查询1023 Have Fun with Numbers (20 分)字符串1024 Palindromic Number (25 分)字符串加法1025 PAT Ranking (25 分)排名1026 Table Tennis (30 分) 1027 Colors in Mars (20 分)进制转换1028 List Sorting (25 分)排序1029 Median (25 分) 1030 Travel Plan (30 分) 1120 Friend Numbers (20 分) 1121 Damn Single (25 分) 1122 Hamiltonian Cycle (25 分) 1123 Is It a Complete AVL Tree (30 分) 1124 Raffle for Weibo Followers (20 分) 1125 Chain the Ropes (25 分)哈夫曼编码的应用1126 Eulerian Path (25 分)连通图+度1127 ZigZagging on a Tree (30 分)中后序建树+层次遍历1128 N Queens Puzzle (20 分)蛮力算法1129 Recommendation System (25 分)排序+前K个1130 Infix Expression (25 分)中序遍历1131 Subway Map (30 分) 1132 Cut Integer (20 分)字符串处理1133 Splitting A Linked List (25 分)链表1134 Vertex Cover (25 分)图+集合1135 Is It A Red-Black Tree (30 分)BST建树+递归1136 A Delayed Palindrome (20 分)字符串处理1137 Final Grading (25 分)STL+查找+排序1138 Postorder Traversal (25 分)先中序求后序1139 First Contact (30 分)STL+集合+图1140 Look-and-say Sequence (20 分)迭代+蛮力算法1141 PAT Ranking of Institutions (25 分)排序1142 Maximal Clique (25 分)无向图1143 Lowest Common Ancestor (30 分)LCA+BST+建树+递归查询1144 The Missing Number (20 分)数值+未出现的最小整数1145 Hashing - Average Search Time (25 分)散列表1146 Topological Order (25 分)拓扑图1147 Heaps (30 分)堆+层次转后序1148 Werewolf - Simple Version (20 分)逻辑推理+蛮力算法1149 Dangerous Goods Packaging (25 分)集合1150 Travelling Salesman Problem (25 分)图遍历1151 LCA in a Binary Tree (30 分)LCA+中先序建树+树的高度1152 Google Recruitment (20 分)字符串变数字+质数+蛮力算法1153 Decode Registration Card of PAT (25 分)STL应用+集合+排序+查询1154 Vertex Coloring (25 分)图+集合个数+边遍历1155 Heap Paths (30 分)DFS+完全二叉树 质数 最小值 建图+连通图 建树+语句判断