2020年9月PAT甲级满分必备刷题技巧

客官°小女子只卖身不卖艺 2023-07-04 03:27 24阅读 0赞

2020年7月的考试结束了，除了本次的考题更新，短期内不会更新。

【7月题目的特点：首次线上考试，没出链表、树相关的模板题，第2到4题背景新颖，大大降低了抄袭历年代码的可能性，可以看作是线上考试的新趋势。不过本次的考点除第四题外也是旧考点，近三年真题也有见过。】

<table style="width:500px;"> 
 <tbody> 
  <tr> 
   <td style="width:76px;">题号</td> 
   <td style="width:167px;">考点</td> 
   <td style="width:257px;">题解</td> 
  </tr> 
  <tr> 
   <td style="width:76px;">1168</td> 
   <td style="width:167px;">素数</td> 
   <td style="width:257px;"><a href="https://blog.csdn.net/allisonshing/article/details/107626283" rel="nofollow">Prime Day(20分)</a></td> 
  </tr> 
  <tr> 
   <td style="width:76px;">1169</td> 
   <td style="width:167px;">数学题、unordered_set或者unodered_map</td> 
   <td style="width:257px;"><a href="https://blog.csdn.net/allisonshing/article/details/107626298" rel="nofollow">The Judger (25分)</a></td> 
  </tr> 
  <tr> 
   <td style="width:76px;">1170</td> 
   <td style="width:167px;">简单图论</td> 
   <td style="width:257px;"><a href="https://blog.csdn.net/allisonshing/article/details/107626318" rel="nofollow">Safari Park (25分)</a></td> 
  </tr> 
  <tr> 
   <td style="width:76px;">1171</td> 
   <td style="width:167px;">模拟题</td> 
   <td style="width:257px;"><a href="https://blog.csdn.net/allisonshing/article/details/107626332" rel="nofollow">Replacement Selection (30分)</a></td> 
  </tr> 
 </tbody> 
</table>

备考的过程对很多人是一件辛苦的事情，请加油，请相信希望的曙光就在眼前。

## 1 分类刷题，刷出水平   1.1先刷最近三年的分类真题1131到1171 ##

Q：为什么要先刷后面这36题？  
A：因为这才是最接近未来考题的题目，刷下来你会发现很多知识点会反复出现。另外，前面题库的题不少超纲，这跟2016年底（我估计的）的时候发布了新的考纲有关。

Q：为什么要按这个顺序刷？  
A：这个顺序是从易到难的，并且是按类型分的，既适合之前按顺序刷过题但是练手还不够的选手，也适合新手。

Q：去哪里提交我写好的题目呢？  
A：题号1131-1155能从甲级题库里找；题号1156-1167，要是想省钱就先看我的题解的题目自己写，等写好了再花点钱到教育超市买，买一次只能生效三小时，逢重大节日可能有六折七折，陈越姥姥会预告的。

Q：如果觉得题目是英文的不好理解，有概念不熟悉、解法不好想到，或者代码不好写，老出BUG，心情好难过的情况怎么办？  
A：如果是差在了知识点，就去补知识点；如果没思路，就去看别人的题解然后独立写，总结坑点，可以说80%真题的情况都可以用老套路应对，努力去做定有收获；如果有bug过不了，就写点测试检查一些，要是太久了都没ac就按别人的思路重新写，不要死磕；如果没状态，就先睡一觉吧。

<table> 
 <thead> 
  <tr> 
   <th colspan="5">近三年的分类真题（共36题，点击标题看我写的题解）</th> 
  </tr> 
  <tr> 
   <th style="width:46px;">次序</th> 
   <th style="width:152px;">类别</th> 
   <th style="width:121px;">年份</th> 
   <th style="width:56px;">题号</th> 
   <th style="width:408px;">标题</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <th style="width:46px;">1</th> 
   <th style="width:152px;">字符串</th> 
   <td style="width:121px;">19冬第一题</td> 
   <td style="width:56px;">1164</td> 
   <td style="width:408px;"> <p><a href="https://blog.csdn.net/allisonshing/article/details/104100616" rel="nofollow">Good in C (20分)</a></p> </td> 
  </tr> 
  <tr> 
   <th style="width:46px;">2</th> 
   <th style="width:152px;">素数、字符串</th> 
   <td style="width:121px;">18冬第一题</td> 
   <td style="width:56px;">1152</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/103959255" rel="nofollow">Google Recruitment (20分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">3</th> 
   <th style="width:152px;">字符串</th> 
   <td style="width:121px;">17冬第一题</td> 
   <td style="width:56px;">1140</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104215950" rel="nofollow">Look-and-say Sequence (20分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">4</th> 
   <th style="width:152px;">字符串</th> 
   <td style="width:121px;">17秋第一题</td> 
   <td style="width:56px;">1136</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104217352" rel="nofollow">A Delayed Palindrome (20分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">5</th> 
   <th style="width:152px;">素数、数学问题</th> 
   <td style="width:121px;">19秋第一题</td> 
   <td style="width:56px;">1160</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104236658" rel="nofollow">Forever (20 分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;"> <p>6</p> </th> 
   <th style="width:152px;">数学问题</th> 
   <td style="width:121px;">18秋第一题</td> 
   <td style="width:56px;">1148</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104242840" rel="nofollow">Werewolf - Simple Version (20分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">7</th> 
   <th style="width:152px;">数学问题</th> 
   <td style="width:121px;">17春第一题</td> 
   <td style="width:56px;">1132</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104265989" rel="nofollow">Cut Integer (20分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">8</th> 
   <th style="width:152px;">素数</th> 
   <td style="width:121px;">19春第一题</td> 
   <td style="width:56px;">1156</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104267776" rel="nofollow">Sexy Primes (20 分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">9</th> 
   <th style="width:152px;">map</th> 
   <td style="width:121px;">18春第一题</td> 
   <td style="width:56px;">1144</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104267998" rel="nofollow">The Missing Number (20分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">10</th> 
   <th style="width:152px;">链表</th> 
   <td style="width:121px;">19冬第二题</td> 
   <td style="width:56px;">1165</td> 
   <td style="width:408px;"> <p><a href="https://blog.csdn.net/allisonshing/article/details/104116640" rel="nofollow">Block Reversing (25分)</a></p> </td> 
  </tr> 
  <tr> 
   <th style="width:46px;">11</th> 
   <th style="width:152px;">链表</th> 
   <td style="width:121px;">19秋第二题</td> 
   <td style="width:56px;">1161</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/100642844" rel="nofollow">Merging Linked Lists (25 分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">12</th> 
   <th style="width:152px;">链表</th> 
   <td style="width:121px;">17春第二题</td> 
   <td style="width:56px;">1133</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104268781" rel="nofollow">Splitting A Linked List（25分）</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">13</th> 
   <th style="width:152px;">排序</th> 
   <td style="width:121px;">19春第二题</td> 
   <td style="width:56px;">1157</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104274669" rel="nofollow">Anniversary（25 分）</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">14</th> 
   <th style="width:152px;">Hash</th> 
   <td style="width:121px;">18春第二题</td> 
   <td style="width:56px;">1145</td> 
   <td style="width:408px;"><a href="https://www.liuchuo.net/archives/4671" rel="nofollow">Hashing - Average Search Time (25分) 直接链到liuchuo的文</a>&nbsp;<a href="https://blog.csdn.net/allisonshing/article/details/104303850" rel="nofollow">相关知识点</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">15</th> 
   <th style="width:152px;">排序、vector、unordered_map</th> 
   <td style="width:121px;">18冬第二题</td> 
   <td style="width:56px;">1153</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104326246" rel="nofollow">Decode Registration Card of PAT (25分) </a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">16</th> 
   <th style="width:152px;">排序、vector、unordered_map</th> 
   <td style="width:121px;">17冬第二题</td> 
   <td style="width:56px;">1141</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104343852" rel="nofollow">Ranking of Institutions (25分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">17</th> 
   <th style="width:152px;">排序、vector、unordered_map</th> 
   <td style="width:121px;">17秋第二题</td> 
   <td style="width:56px;">1137</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104355181" rel="nofollow">Final Grading (25分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">31</th> 
   <th style="width:152px;">Hash、图</th> 
   <td style="width:121px;">18冬第三题</td> 
   <td style="width:56px;">1154</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104799581" rel="nofollow">Vertex Coloring (25分) </a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">32</th> 
   <th style="width:152px;">Hash、排序、vector、unordered_map</th> 
   <td style="width:121px;">17秋第四题</td> 
   <td style="width:56px;">1139</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104912070" rel="nofollow">First Contact (30分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">33</th> 
   <th style="width:152px;"> <p>Hash、vector、结构体</p> </th> 
   <td style="width:121px;">17春第三题</td> 
   <td style="width:56px;">1134</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/105058072" rel="nofollow">Vertex Cover (25分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">34</th> 
   <th style="width:152px;">Hash、map</th> 
   <td style="width:121px;">18秋第二题</td> 
   <td style="width:56px;">1149</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104294582" rel="nofollow">Dangerous Goods Packaging（25 分）</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">18</th> 
   <th style="width:152px;">图</th> 
   <td style="width:121px;">19冬第三题</td> 
   <td style="width:56px;">1166</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104094815" rel="nofollow">Summit (25分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">19</th> 
   <th style="width:152px;">图、并查集</th> 
   <td style="width:121px;">19春第三题</td> 
   <td style="width:56px;">1158</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104361040" rel="nofollow">Telefraud Detection (25分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">20</th> 
   <th style="width:152px;">图</th> 
   <td style="width:121px;">18秋第三题</td> 
   <td style="width:56px;">1150</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104413318" rel="nofollow">Travelling Salesman Problem (25分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">21</th> 
   <th style="width:152px;">完全二叉树、堆、DFS</th> 
   <td style="width:121px;">18春第四题</td> 
   <td style="width:56px;">1147</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104425394" rel="nofollow">Heaps (30分) </a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">22</th> 
   <th style="width:152px;">完全二叉树、堆、DFS</th> 
   <td style="width:121px;">18冬第四题</td> 
   <td style="width:56px;">1155</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104448296" rel="nofollow">Heap Paths (30分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">23</th> 
   <th style="width:152px;">图、简单图论</th> 
   <td style="width:121px;">17秋第三题</td> 
   <td style="width:56px;">1142</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104472391" rel="nofollow">Maximal Clique (25分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">24</th> 
   <th style="width:152px;">树、建树、BFS</th> 
   <td style="width:121px;">19冬第四题</td> 
   <td style="width:56px;">1167</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104094753" rel="nofollow">Cartesian Tree (30分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">25</th> 
   <th style="width:152px;">树、建树、DFS</th> 
   <td style="width:121px;">19秋第三题</td> 
   <td style="width:56px;">1162</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/100642958" rel="nofollow">Postfix Expression (25 分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">26</th> 
   <th style="width:152px;">树、建树、map</th> 
   <td style="width:121px;">19春第四题</td> 
   <td style="width:56px;">1159</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104475744" rel="nofollow">Structure of a Binary Tree（30分）</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">27</th> 
   <th style="width:152px;">树、LCA</th> 
   <td style="width:121px;">18秋第四题</td> 
   <td style="width:56px;">1151</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104570744" rel="nofollow">LCA in a Binary Tree (30分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">28</th> 
   <th style="width:152px;">树、BST、LCA</th> 
   <td style="width:121px;">17冬第四题</td> 
   <td style="width:56px;">1143</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104604908" rel="nofollow">Lowest Common Ancestor（30分）</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">29</th> 
   <th style="width:152px;">树、DFS</th> 
   <td style="width:121px;"> <p style="margin-left:0px;">17秋第三题</p> </td> 
   <td style="width:56px;">1138</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104762373" rel="nofollow">Postorder Traversal (25分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">30</th> 
   <th style="width:152px;">树、红黑树</th> 
   <td style="width:121px;">17春第四题</td> 
   <td style="width:56px;">1135</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104782967" rel="nofollow">Is It A Red-Black Tree (30分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">35</th> 
   <th style="width:152px;">拓扑排序</th> 
   <td style="width:121px;">18春第三题</td> 
   <td style="width:56px;">1146</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/104858079" rel="nofollow">Topological Order (25分)</a></td> 
  </tr> 
  <tr> 
   <th style="width:46px;">36</th> 
   <th style="width:152px;">Dijkstra</th> 
   <td style="width:121px;">19秋第四题</td> 
   <td style="width:56px;">1163</td> 
   <td style="width:408px;"><a href="https://blog.csdn.net/allisonshing/article/details/100643092" rel="nofollow">Dijkstra Sequence (30 分)&nbsp;</a></td> 
  </tr> 
 </tbody> 
</table>

## 1.2 然后再刷分类题库1001到1131（另外开帖） ##

# 2 刷题总结 站得更高 #

独立练习之余，也得通过自己的总结巩固所学，用技巧与坑点搭建坚固体系。

## 2.1 考前专题复习（已经开始更新） ##

## 2.2 [PAT甲级数据结构类技术总结（完结）][PAT] ##

# 3 彩蛋 #

1.有时候想到之前有个知识点但是也不知道在哪一题的，可以在csdn博客里搜索关键字得到。

2.[liuchuo][]的代码最好读，是仔细打磨过的代码，简介明了，想大家推荐。我也是在模仿这种风格，这里要向她和其他前辈致敬。  
如果也有喜欢参考她的代码的同学，肯定会发现我一般也是用她用过的函数来写代码的。

3.一幅励志漫画：

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2FsbGlzb25zaGluZw_size_16_color_FFFFFF_t_70][]

如果喜欢我的文章，请给我点赞哦！我会更新得更快的，祝大家高分通过～

[PAT]: https://blog.csdn.net/allisonshing/article/details/104871319
[liuchuo]: https://blog.csdn.net/liuchuo
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2FsbGlzb25zaGluZw_size_16_color_FFFFFF_t_70]: https://img-blog.csdnimg.cn/2020080215275767.jpg?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2FsbGlzb25zaGluZw==,size_16,color_FFFFFF,t_70