PAT 目录
浙江大学 PAT 甲级考试题集
By 滚键盘(iofu728)
github 地址：https://github.com/iofu728/PAT-A-by-iofu728
- Summary
- ANOJ 目录 官网
| Id | Title | Solution | Type | Hard |
|---|---|---|---|---|
| 1022 | 库洛值（20） | 🤔 | hashMap | ☆ |
| 1023 | 缺失数（25） | 🤔 | bitMap | ☆☆☆ |
| 1024 | 宇宙树（25） | 🤔 | DFS | ★★★☆ |
| 1025 | 已经没什么好害怕了（30） | 🤔 | Dijkstra | 未知 |
- PAT A 目录 官网(107/151)
| Id | Title | Solution | Type | Hard |
|---|---|---|---|---|
| 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) | ✔️ | sort | ☆ |
| 1007 | Maximum Subsequence Sum (25) | ✔️ | dp | ☆★ |
| 1008 | Elevator (20) | ✔️ | 模拟 | ☆☆ |
| 1009 | Product of Polynomials (25) | ✔️ | 多项式 | ☆☆ |
| 1010 | Radix (25) | ✔️ | 进制转换 | ☆★ |
| 1011 | World Cup Betting (20) | ✔️ | 模拟 | ☆☆ |
| 1012 | The Best Rank (25) | ✔️ | sort | ☆☆ |
| 1013 | Battle Over Cities (25) | ✔️ | DFS,连通分量 | ☆☆☆ |
| 1014 | Waiting in Line (30) | 🤔 | 排队模拟,queue,sort | ★★★★ |
| 1015 | Reversible Primes (20) | ✔️ | 素数，进制转换 | ☆ |
| 1016 | Phone Bills (25) | ✔️ | sort | ☆☆ |
| 1017 | Queueing at Bank (25) | 🤔 | 排队,模拟,sort | ☆☆☆ |
| 1018 | Public Bike Management (30) | 🤔 | Dijkstra,DFS | ★★★★ |
| 1019 | General Palindromic Number (20) | ✔️ | 进制转换,回文 | ☆ |
| 1020 | Tree Traversals (25) | ✔️ | 树的遍历 | ☆☆ |
| 1021 | Deepest Root (25) | 🤔 | 无环判断,树深度,最深源点 | ★★★☆ |
| 1022 | Digital Library (30) | 🤔 | map,set | ☆☆☆ |
| 1023 | Have Fun with Numbers (20) | ✔️ | 大整数,前置 0 | ☆★★ |
| 1024 | Palindromic Number (25) | ✔️ | 大整数,回文 | ☆ |
| 1025 | PAT Ranking (25) | ✔️ | sort | ☆ |
| 1026 | Table Tennis (30) | ✔️ | 排队,模拟,sort | ★★★★☆ |
| 1027 | Colors in Mars (20) | ✔️ | 进制转换 | ☆ |
| 1028 | List Sorting (25) | ✔️ | sort | ☆ |
| 1029 | Median (25) | ✔️ | 中间数 | ☆☆ |
| 1030 | Travel Plan (30) | ✔️ | Dijkstra | ☆★ |
| 1031 | Hello World for U (20) | ✔️ | 图形 | ☆ |
| 1032 | Sharing (25) | ✔️ | 链表 | ☆ |
| 1033 | To Fill or Not to Fill (25) | 🤔 | 贪心，模拟 | ★★★★ |
| 1034 | Head of a Gang (30) | 🤔 | DFS,map | ☆☆☆ |
| 1035 | Password (20) | ✔️ | 字符串 | ☆ |
| 1036 | Boys vs Girls (25) | ✔️ | sort | ☆ |
| 1037 | Magic Coupon (25) | ✔️ | sort | ☆ |
| 1038 | Recover the Smallest Number (30) | ✔️ | sort，字符串相加 | ☆★ |
| 1039 | Course List for Student (25) | ✔️ | 手动 map | ☆★ |
| 1040 | Longest Symmetric String (25) | 🤔 | 动态规划 | ☆☆☆ |
| 1041 | Be Unique (20) | ✔️ | hash | ☆ |
| 1042 | Shuffling Machine (20) | ✔️ | 模拟 | ☆ |
| 1043 | Is It a Binary Search Tree (25) | ✔️ | 树的遍历 | ☆★ |
| 1044 | Shopping in Mars (25) | 🤔 | dp,查找 | ☆☆☆ |
| 1045 | Favorite Color Stripe (30) | ✔️ | dp,最长不下降序列 | ☆☆☆ |
| 1046 | Shortest Distance (20) | ✔️ | 模拟 | ☆ |
| 1047 | Student List for Course (25) | ✔️ | hash | ☆ |
| 1048 | Find Coins (25) | ✔️ | 二分查找 | ☆★ |
| 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 | ☆ |
| 1055 | The World’s Richest (25) | ✔️ | sort | ☆ |
| 1056 | Mice and Rice (25) | 🤔 | 模拟，晋级 | ☆☆★ |
| 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) | ✔️ | sort | ☆ |
| 1063 | Set Similarity (25) | ✔️ | set | ☆ |
| 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) | ✔️ | string.insert | ☆ |
| 1070 | Mooncake (25) | ✔️ | sort | ☆ |
| 1071 | Speech Patterns (25) | ✔️ | map | ☆ |
| 1072 | Gas Station (30) | 🤔 | Dijkstra | ☆☆☆ |
| 1073 | Scientific Notation (20) | ✔️ | 字符串转数字 | ☆☆ |
| 1074 | Reversing Linked List (25) | ✔️ | 链表翻转 | ☆☆ |
| 1075 | PAT Judge (25) | 🤔 | sort | ☆☆☆ |
| 1076 | Forwards on Weibo (30) | 🤔 | BFS | ☆☆☆ |
| 1077 | Kuchiguse (20) | ✔️ | 字符串 | ☆ |
| 1078 | Hashing (25) | ✔️ | 散列，平方 | ☆☆ |
| 1079 | Total Sales of Supply Chain (25) | 🤔 | BFS/DFS | ☆☆☆ |
| 1080 | Graduate Admission (30) | 🤔 | sort | ☆☆★ |
| 1081 | Rational Sum (20) | ✔️ | gcd | ☆ |
| 1082 | Read Number in Chinese (25) | 🤔 | 字符串 | ★★☆ |
| 1083 | List Grades (25) | ✔️ | sort | ☆☆ |
| 1084 | Broken Keyboard (20) | ✔️ | hash | ☆ |
| 1085 | Perfect Sequence (25) | ✔️ | two pointer | ☆★ |
| 1086 | Tree Traversals Again (25) | 🤔 | 二叉树遍历 | ☆☆★ |
| 1087 | All Roads Lead to Rome (30) | 🤔 | Dijkstra DFS | ★★☆☆ |
| 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) | ✔️ | BFS 剪枝 | ☆★ |
| 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) | ✖️ | ||
| 1138 | 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) | ✖️ |
You can use this BibTex to reference this blog if you find it useful and want to quote it.