力求用最简洁明了的方式给出题解，并附上也许对新手陌生的知识点以及题目易错点等，如果能帮到你的话那就太棒啦~
PAT甲级目录 | PAT乙级目录有不懂的语法记得多去 www.cplusplus.com 翻翻文档，这里啥都有哦。
| No | Title | C/C++ | Python | 备注 |
|---|---|---|---|---|
| 1001 | A+B Format (20’) | 查看题解 | 字符串处理 | |
| 1002 | A+B for Polynomials (25’) | 模拟 | ||
| 1003 | Emergency (25’) | Dijkstra算法 | ||
| 1004 | Counting Leaves (30’) | BFS，DFS，树的层序遍历 | ||
| 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’) | queue的应用 | ||
| 1015 | Reversible Primes (20’) | 素数 | ||
| 1016 | Phone Bills (25’) | 排序 | ||
| 1017 | Queueing at Bank (25’) | 模拟 | ||
| 1018 | Public Bike Management (30’) | Dijkstra算法 + DFS | ||
| 1019 | General Palindromic Number (20’) | 回文数 | ||
| 1020 | Tree Traversals (25’) | 二叉树的遍历，后序中序转层序 | ||
| 1021 | Deepest Root (25’) | 图的遍历，DFS，计算连通分量的个数 | ||
| 1022 | Digital Library (30’) | map映射，STL的使用 | ||
| 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’) | two pointers | ||
| 1030 | Travel Plan (30’) | Dijkstra算法 + DFS，最短路径，边权 | ||
| 1031 | Hello World for U (20’) | 图形打印 | ||
| 1032 | Sharing (25’) | 链表 | ||
| 1033 | To Fill or Not to Fill (25’) | 贪心算法 | ||
| 1034 | Head of a Gang (30’) | 图的遍历，DFS | ||
| 1035 | Password (20’) | 字符串处理 | ||
| 1036 | Boys vs Girls (25’) | 查找元素 | ||
| 1037 | Magic Coupon (25’) | 贪心算法 | ||
| 1038 | Recover the Smallest Number (30’) | 贪心算法 | ||
| 1039 | Course List for Student (25’) | 不定长数组vector，STL的使用 | ||
| 1040 | Longest Symmetric String (25’) | 动态规划 | ||
| 1041 | Be Unique (20’) | Hash散列 | ||
| 1042 | Shuffling Machine (20’) | 模拟 | ||
| 1043 | Is It a Binary Search Tree (25’) | 二叉查找树BST | ||
| 1044 | Shopping in Mars (25’) | 二分查找 | ||
| 1045 | Favorite Color Stripe (30’) | 动态规划，LIS / LCS | ||
| 1046 | Shortest Distance (20’) | 模拟 | ||
| 1047 | Student List for Course (25’) | 不定长数组vector，STL的使用 | ||
| 1048 | Find Coins (25’) | Hash散列 | ||
| 1049 | Counting Ones (30’) | 数学问题 | ||
| 1050 | String Subtraction (20’) | Hash散列 | ||
| 1051 | Pop Sequence (25’) | 栈模拟 | ||
| 1052 | Linked List Sorting (25’) | 链表 | ||
| 1053 | Path of Equal Weight (30’) | 树的遍历 | ||
| 1054 | The Dominant Color (20’) | map映射，STL的使用 | ||
| 1055 | The World’s Richest (25’) | 排序 | ||
| 1056 | Mice and Rice (25’) | queue的用法 | ||
| 1057 | Stack (30’) | 树状数组 | ||
| 1058 | A+B in Hogwarts (20’) | 进制转换 | ||
| 1059 | Prime Factors (25’) | 素数表的建立 | ||
| 1060 | Are They Equal (25’) | 科学计数法 | ||
| 1061 | Dating (20’) | 查看题解 | 字符串处理 | |
| 1062 | Talent and Virtue (25’) | 查看题解 | 排序 | |
| 1063 | Set Similarity (25’) | 集合set，STL的使用 | ||
| 1064 | Complete Binary Search Tree (30’) | 二叉查找树BST | ||
| 1065 | A+B and C (64bit) (20’) | 模拟 | ||
| 1066 | Root of AVL Tree (25’) | 平衡二叉树（AVL树） | ||
| 1067 | Sort with Swap(0,*) (25’) | 贪心算法 | ||
| 1068 | Find More Coins (30’) | 01背包，动态规划 | ||
| 1069 | The Black Hole of Numbers (20’) | 查看题解 | 数学问题 | |
| 1070 | Mooncake (25’) | 查看题解 | 贪心算法 | |
| 1071 | Speech Patterns (25’) | map映射，STL的使用 | ||
| 1072 | Gas Station (30’) | Dijkstra算法 | ||
| 1073 | Scientific Notation (20’) | 查看题解 | 字符串处理 | |
| 1074 | Reversing Linked List (25’) | 查看题解 | 链表 | |
| 1075 | PAT Judge (25’) | 排序 | ||
| 1076 | Forwards on Weibo (30’) | 图的遍历，BFS | ||
| 1077 | Kuchiguse (20’) | 字符串处理 | ||
| 1078 | Hashing (25’) | 二次方探查法 | ||
| 1079 | Total Sales of Supply Chain (25’) | DFS，BFS，树的遍历 | ||
| 1080 | Graduate Admission (30’) | 排序 | ||
| 1081 | Rational Sum (20’) | 分数的四则运算 | ||
| 1082 | Read Number in Chinese (25’) | 字符串处理 | ||
| 1083 | List Grades (25’) | 排序 | ||
| 1084 | Broken Keyboard (20’) | 查看题解 | Hash散列 | |
| 1085 | Perfect Sequence (25’) | 查看题解 | ||
| 1086 | Tree Traversals Again (25’) | |||
| 1087 | All Roads Lead to Rome (30’) | |||
| 1088 | Rational Arithmetic (20’) | 查看题解 | ||
| 1089 | Insert or Merge (25’) | 查看题解 | ||
| 1090 | Highest Price in Supply Chain (25’) | |||
| 1091 | Acute Stroke (30’) | |||
| 1092 | To Buy or Not to Buy (20’) | |||
| 1093 | Count PAT’s (25’) | 查看题解 | ||
| 1094 | The Largest Generation (25’) | |||
| 1095 | Cars on Campus (30’) | |||
| 1096 | Consecutive Factors (20’) | |||
| 1097 | Deduplication on a Linked List (25’) | |||
| 1098 | Insertion or Heap Sort (25’) | |||
| 1099 | Build A Binary Search Tree (30’) | |||
| 1100 | Mars Numbers (20’) | 查看题解 | ||
| 1101 | Quick Sort (25’) | 查看题解 | ||
| 1102 | Invert a Binary Tree (25’) | |||
| 1103 | Integer Factorization (30’) | |||
| 1104 | Sum of Number Segments (20’) | 查看题解 | ||
| 1105 | Spiral Matrix (25’) | |||
| 1106 | Lowest Price in Supply Chain (25’) | |||
| 1107 | Social Clusters (30’) | |||
| 1108 | Finding Average (20’) | 查看题解 | ||
| 1109 | Group Photo (25’) | 查看题解 | ||
| 1110 | Complete Binary Tree (25’) | |||
| 1111 | Online Map (30’) | |||
| 1112 | Stucked Keyboard (20’) | |||
| 1113 | Integer Set Partition (25’) | |||
| 1114 | Family Property (25’) | |||
| 1115 | Counting Nodes in a BST (30’) | |||
| 1116 | Come on! Let’s C (20’) | 查看题解 | ||
| 1117 | Eddington Number (25’) | 查看题解 | ||
| 1118 | Birds in Forest (25’) | |||
| 1119 | Pre- and Post-order Traversals (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’) | |||
| 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’) | |||
| 1136 | A Delayed Palindrome (20’) | 查看题解 | ||
| 1137 | Final Grading (25’) | 查看题解 | ||
| 1128 | Postorder Traversal (25’) | |||
| 1139 | First Contact (30’) | |||
| 1140 | Look-and-say Sequence (20’) | 查看题解 | ||
| 1141 | PAT Ranking of Institutions (25’) | 查看题解 | ||
| 1142 | Maximal Clique (25’) | |||
| 1143 | Lowest Common Ancestor (30’) | |||
| 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’) |