KO
|
EN
gitlite — search
Search
#javascript
#python
#hacktoberfest
#react
#ai
#typescript
#llm
#go
#golang
#android
#machine-learning
#rust
#deep-learning
#linux
PAT-Practise
★ 8
Open GitHub ↗
PAT 题目集
Download README (.md)
Explore Similar Repositories
wechat_jump_gui
:
使用QT进行界面开发
mybatis_atguigu
:
mybatis尚硅谷教学视频源码
stm32-qspi-fat-usb
:
STM32 Cube and System Workbench project for STM32L476 Discovery Board
fast.ai
:
Notes and examples from the fast.ai course
ClassicalCode
:
一些背下来也毫不过分的经典代码
// repository documentation
Was this content helpful?
★ 0
(0 ratings)
Select Rating:
★
★
★
★
★
Submit Feedback
Recent Feedback
×
Download README
Do you want to download the
README.md
file for
PAT-Practise
?
Download (.md)
# PAT-Practise ## [顶级](https://pintia.cn/problem-sets/994805148990160896/problems)(https://pintia.cn/problem-sets/994805148990160896/problems) | 序号（原题地址） | 代码 |题解 | |---|---|---| |[1002 Business (35)](https://pintia.cn/problem-sets/994805148990160896/problems/994805156145643520)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Top%20Level%20Practice/1002/1002%20Business%20(35)%20.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Top%20Level%20Practice/1002/Solution.md)| |[1003 Universal Travel Sites (35)](https://pintia.cn/problem-sets/994805148990160896/problems/994805155688464384)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Top%20Level%20Practice/1003/Universal%20Travel%20Sites%20(35).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Top%20Level%20Practice/1003/Solution.md)| |[1010 Lehmer Code(35)](https://pintia.cn/problem-sets/994805148990160896/problems/994805152735674368)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Top%20Level%20Practice/1010/Lehmer%20Code.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Top%20Level%20Practice/1010/Solution.md)| |[1013 Image Segmentation(35 point(s))](https://pintia.cn/problem-sets/994805148990160896/problems/994805151670321152)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Top%20Level%20Practice/1013/1013%20Image%20Segmentation.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Top%20Level%20Practice/1013/Solution.md)| |[1014 Circles of Friends(35)](https://pintia.cn/problem-sets/994805148990160896/problems/994805151343165440)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Top%20Level%20Practice/1014/1014%20Circles%20of%20Friends(35).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Top%20Level%20Practice/1014/Solution.md)| |[1016 Uniqueness of MST(35 point(s))](https://pintia.cn/problem-sets/994805148990160896/problems/994805150751768576)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Top%20Level%20Practice/1016/Uniqueness%20of%20MST(35).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Top%20Level%20Practice/1016/Solution.md)| ## [甲级](https://pintia.cn/problem-sets/994805342720868352/problems)(https://pintia.cn/problem-sets/994805342720868352/problems) [PAT甲级](https://pintia.cn/problem-sets/994805342720868352/problems)题解，代码主要用`C++`实现，每题的`Solution`是较为详细的题解，包括原题、题意、思路与代码。部分题目参考了[@liuchuo](https://github.com/liuchuo)(柳婼)的网站：[PAT甲级题解目录](https://www.liuchuo.net/pat%e7%94%b2%e7%ba%a7%e9%a2%98%e8%a7%a3%e7%9b%ae%e5%bd%95) ,以及其他题解版本。 --- *注: 在PAT提交时，部分C++代码开头的#include "stdafx.h"应删除* | 序号（原题地址） | 代码 |题解 | |---|---|---| |[1001. A+B Format (20)](https://www.patest.cn/contests/pat-a-practise/1001)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1001.%20A+B%20Format%20(20)/1001.%20A+B%20Format%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1001.%20A+B%20Format%20(20)/Solution.md)| |[1002. A+B for Polynomials (25)](https://www.patest.cn/contests/pat-a-practise/1002)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1002.%20A+B%20for%20Polynomials%20(25)/1002.%20A+B%20for%20Polynomials%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1002.%20A+B%20for%20Polynomials%20(25)/Solution.md)| |[1003. Emergency (25)](https://www.patest.cn/contests/pat-a-practise/1003)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1003.%20Emergency%20(25)/1003.%20Emergency%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1003.%20Emergency%20(25)/Solution.md)| |[1004. Counting Leaves (30)](https://www.patest.cn/contests/pat-a-practise/1004)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1004.%20Counting%20Leaves%20(30)/1004.%20Counting%20Leaves%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1004.%20Counting%20Leaves%20(30)/Solution.md)| |[1005. Spell It Right (20)](https://www.patest.cn/contests/pat-a-practise/1005)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1005.%20Spell%20It%20Right%20(20)/1005.%20Spell%20It%20Right%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1005.%20Spell%20It%20Right%20(20)/Solution.md)| |[1006. Sign In and Sign Out (25)](https://www.patest.cn/contests/pat-a-practise/1006)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1006.%20Sign%20In%20and%20Sign%20Out%20(25)/1006.%20Sign%20In%20and%20Sign%20Out%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1006.%20Sign%20In%20and%20Sign%20Out%20(25)/Solution.md)| |[1007. Maximum Subsequence Sum (25)](https://www.patest.cn/contests/pat-a-practise/1007)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1007.%20Maximum%20Subsequence%20Sum%20(25)/1007.%20Maximum%20Subsequence%20Sum%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1007.%20Maximum%20Subsequence%20Sum%20(25)/Solution.md)| |[1008. Elevator (20)](https://www.patest.cn/contests/pat-a-practise/1008)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1008.%20Elevator%20(20)/1008.%20Elevator%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1008.%20Elevator%20(20)/Solution.md)| |[1009. Product of Polynomials (25)](https://www.patest.cn/contests/pat-a-practise/1009)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1009.%20Product%20of%20Polynomials%20(25)/1009.%20Product%20of%20Polynomials%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1009.%20Product%20of%20Polynomials%20(25)/Solution.md)| |[1010. Radix (25)](https://www.patest.cn/contests/pat-a-practise/1010)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1010.%20Radix%20(25)/1010.%20Radix%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1010.%20Radix%20(25)/Solution.md)| |[1011. World Cup Betting (20)](https://www.patest.cn/contests/pat-a-practise/1011)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1011.%20World%20Cup%20Betting%20(20)/1011.%20World%20Cup%20Betting%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1011.%20World%20Cup%20Betting%20(20)/Solution.md)| |[1012. The Best Rank (25)](https://www.patest.cn/contests/pat-a-practise/1012)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1012.%20The%20Best%20Rank%20(25)/1012.%20The%20Best%20Rank%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1012.%20The%20Best%20Rank%20(25)/Solution.md)| |[1013. Battle Over Cities (25)](https://www.patest.cn/contests/pat-a-practise/1013)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1013.%20Battle%20Over%20Cities%20(25)/1013.%20Battle%20Over%20Cities%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1013.%20Battle%20Over%20Cities%20(25)/Solution.md)| |[1014. Waiting in Line (30)](https://www.patest.cn/contests/pat-a-practise/1014)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1014.%20Waiting%20in%20Line%20(30)/1014.%20Waiting%20in%20Line%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1014.%20Waiting%20in%20Line%20(30)/Solution.md)| |[1015. Reversible Primes (20)](https://www.patest.cn/contests/pat-a-practise/1015)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1015.%20Reversible%20Primes%20(20)/1015.%20Reversible%20Primes%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1015.%20Reversible%20Primes%20(20)/Solution.md)| |[1016. Phone Bills (25)](https://www.patest.cn/contests/pat-a-practise/1016)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1016.%20Phone%20Bills%20(25)/1016.%20Phone%20Bills%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1016.%20Phone%20Bills%20(25)/Solution.md)| |[1017. Queueing at Bank (25)](https://www.patest.cn/contests/pat-a-practise/1017)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1017.%20Queueing%20at%20Bank%20(25)/1017.%20Queueing%20at%20Bank%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1017.%20Queueing%20at%20Bank%20(25)/Solution.md)| |[1018. Public Bike Management (30)](https://www.patest.cn/contests/pat-a-practise/1018)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1018.%20Public%20Bike%20Management%20(30)/1018.%20Public%20Bike%20Management%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1018.%20Public%20Bike%20Management%20(30)/Solution.md)| |[1019. General Palindromic Number (20)](https://www.patest.cn/contests/pat-a-practise/1019)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1019.%20General%20Palindromic%20Number%20(20)/1019.%20General%20Palindromic%20Number%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1019.%20General%20Palindromic%20Number%20(20)/Solution.md)| |[1020. Tree Traversals (25)](https://www.patest.cn/contests/pat-a-practise/1020)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1020.%20Tree%20Traversals%20(25)/1020.%20Tree%20Traversals%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1020.%20Tree%20Traversals%20(25)/Solution.md)| |[1021. Deepest Root (25)](https://www.patest.cn/contests/pat-a-practise/1021)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1021.%20Deepest%20Root%20(25)/1021.%20Deepest%20Root%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1021.%20Deepest%20Root%20(25)/Solution.md)| |[1022. Digital Library (30)](https://www.patest.cn/contests/pat-a-practise/1022)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1022.%20Digital%20Library%20(30)/1022.%20Digital%20Library%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1022.%20Digital%20Library%20(30)/Solution.md)| |[1023. Have Fun with Numbers (20)](https://www.patest.cn/contests/pat-a-practise/1023)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1023.%20Have%20Fun%20with%20Numbers%20(20)/1023.%20Have%20Fun%20with%20Numbers%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1023.%20Have%20Fun%20with%20Numbers%20(20)/Solution.md)| |[1024. Palindromic Number (25)](https://www.patest.cn/contests/pat-a-practise/1024)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1024.%20Palindromic%20Number%20(25)/1024.%20Palindromic%20Number%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1024.%20Palindromic%20Number%20(25)/Solution.md)| |[1025. PAT Ranking (25)](https://www.patest.cn/contests/pat-a-practise/1025)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1025.%20PAT%20Ranking%20(25)/1025.%20PAT%20Ranking%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1025.%20PAT%20Ranking%20(25)/Solution.md)| |[1026. Table Tennis (30)](https://www.patest.cn/contests/pat-a-practise/1026)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1026.%20Table%20Tennis%20(30)/1026.%20Table%20Tennis%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1026.%20Table%20Tennis%20(30)/Solution.md)| |[1027. Colors in Mars (20)](https://www.patest.cn/contests/pat-a-practise/1027)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1027.%20Colors%20in%20Mars%20(20)/1027.%20Colors%20in%20Mars%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1027.%20Colors%20in%20Mars%20(20)/Solution.md)| |[1028. List Sorting (25)](https://www.patest.cn/contests/pat-a-practise/1028)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1028.%20List%20Sorting%20(25)/1028.%20List%20Sorting%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1028.%20List%20Sorting%20(25)/Solution.md)| |[1029. Median (25)](https://www.patest.cn/contests/pat-a-practise/1029)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1029.%20Median%20(25)/1029.%20Median%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1029.%20Median%20(25)/Solution.md)| |[1030. Travel Plan (30)](https://www.patest.cn/contests/pat-a-practise/1030)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1030.%20Travel%20Plan%20(30)/1030.%20Travel%20Plan%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1030.%20Travel%20Plan%20(30)/Solution.md)| |[1031. Hello World for U (20)](https://www.patest.cn/contests/pat-a-practise/1031)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1031.%20Hello%20World%20for%20U%20(20)/1031.%20Hello%20World%20for%20U%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1031.%20Hello%20World%20for%20U%20(20)/Solution.md)| |[1032. Sharing (25)](https://www.patest.cn/contests/pat-a-practise/1032)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1032.%20Sharing%20(25)/1032.%20Sharing%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1032.%20Sharing%20(25)/Solution.md)| |[1033. To Fill or Not to Fill (25)](https://www.patest.cn/contests/pat-a-practise/1033)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1033.%20To%20Fill%20or%20Not%20to%20Fill%20(25)/1033.%20To%20Fill%20or%20Not%20to%20Fill%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1033.%20To%20Fill%20or%20Not%20to%20Fill%20(25)/Solution.md)| |[1034. Head of a Gang (30)](https://www.patest.cn/contests/pat-a-practise/1034)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1034.%20Head%20of%20a%20Gang%20(30)/1034.%20Head%20of%20a%20Gang%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1034.%20Head%20of%20a%20Gang%20(30)/Solution.md)| |[1035. Password (20)](https://www.patest.cn/contests/pat-a-practise/1035)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1035.%20Password%20(20)/1035.%20Password%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1035.%20Password%20(20)/Solution.md)| |[1036. Boys vs Girls (25)](https://www.patest.cn/contests/pat-a-practise/1036)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1036.%20Boys%20vs%20Girls%20(25)/1036.%20Boys%20vs%20Girls%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1036.%20Boys%20vs%20Girls%20(25)/Solution.md)| |[1037. Magic Coupon (25)](https://www.patest.cn/contests/pat-a-practise/1037)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1037.%20Magic%20Coupon%20(25)/1037.%20Magic%20Coupon%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1037.%20Magic%20Coupon%20(25)/Solution.md)| |[1038. Recover the Smallest Number (30)](https://www.patest.cn/contests/pat-a-practise/1038)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1038.%20Recover%20the%20Smallest%20Number%20(30)/1038.%20Recover%20the%20Smallest%20Number%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1038.%20Recover%20the%20Smallest%20Number%20(30)/Solution.md)| |[1039. Course List for Student (25)](https://www.patest.cn/contests/pat-a-practise/1039)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1039.%20Course%20List%20for%20Student%20(25)/1039.%20Course%20List%20for%20Student%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1039.%20Course%20List%20for%20Student%20(25)/Solution.md)| |[1040. Longest Symmetric String (25)](https://www.patest.cn/contests/pat-a-practise/1040)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1040.%20Longest%20Symmetric%20String%20(25)/1040.%20Longest%20Symmetric%20String%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1040.%20Longest%20Symmetric%20String%20(25)/Solution.md)| |[1041. Be Unique (20)](https://www.patest.cn/contests/pat-a-practise/1041)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1041.%20Be%20Unique%20(20)/1041.%20Be%20Unique%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1041.%20Be%20Unique%20(20)/Solution.md)| |[1042. Shuffling Machine (20)](https://www.patest.cn/contests/pat-a-practise/1042)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1042.%20Shuffling%20Machine%20(20)/1042.%20Shuffling%20Machine%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1042.%20Shuffling%20Machine%20(20)/Solution.md)| |[1043. Is It a Binary Search Tree (25)](https://www.patest.cn/contests/pat-a-practise/1043)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1043.%20Is%20It%20a%20Binary%20Search%20Tree%20(25)/1043.%20Is%20It%20a%20Binary%20Search%20Tree%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1043.%20Is%20It%20a%20Binary%20Search%20Tree%20(25)/Solution.md)| |[1044. Shopping in Mars (25)](https://www.patest.cn/contests/pat-a-practise/1044)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1044.%20Shopping%20in%20Mars%20(25)/1044.%20Shopping%20in%20Mars%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1044.%20Shopping%20in%20Mars%20(25)/Solution.md)| |[1045. Favorite Color Stripe (30)](https://www.patest.cn/contests/pat-a-practise/1045)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1045.%20Favorite%20Color%20Stripe%20(30)/1045.%20Favorite%20Color%20Stripe%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1045.%20Favorite%20Color%20Stripe%20(30)/Solution.md)| |[1046. Shortest Distance (20)](https://www.patest.cn/contests/pat-a-practise/1046)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1046.%20Shortest%20Distance%20(20)/1046.%20Shortest%20Distance%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1046.%20Shortest%20Distance%20(20)/Solution.md)| |[1047. Student List for Course (25)](https://www.patest.cn/contests/pat-a-practise/1047)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1047.%20Student%20List%20for%20Course%20(25)/1047.%20Student%20List%20for%20Course%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1047.%20Student%20List%20for%20Course%20(25)/Solution.md)| |[1048. Find Coins (25)](https://www.patest.cn/contests/pat-a-practise/1048)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1048.%20Find%20Coins%20(25)/1048.%20Find%20Coins%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1048.%20Find%20Coins%20(25)/Solution.md)| |[1049. Counting Ones (30)](https://www.patest.cn/contests/pat-a-practise/1049)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1049.%20Counting%20Ones%20(30)/1049.%20Counting%20Ones%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1049.%20Counting%20Ones%20(30)/Solution.md)| |[1050. String Subtraction (20)](https://www.patest.cn/contests/pat-a-practise/1050)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1050.%20String%20Subtraction%20(20)/1050.%20String%20Subtraction%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1050.%20String%20Subtraction%20(20)/Solution.md)| |[1051. Pop Sequence (25)](https://www.patest.cn/contests/pat-a-practise/1051)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1051.%20Pop%20Sequence%20(25)/1051.%20Pop%20Sequence%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1051.%20Pop%20Sequence%20(25)/Solution.md)| |[1052. Linked List Sorting (25)](https://www.patest.cn/contests/pat-a-practise/1052)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1052.%20Linked%20List%20Sorting%20(25)/1052.%20Linked%20List%20Sorting%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1052.%20Linked%20List%20Sorting%20(25)/Solution.md)| |[1053. Path of Equal Weight (30)](https://www.patest.cn/contests/pat-a-practise/1053)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1053.%20Path%20of%20Equal%20Weight%20(30)/1053.%20Path%20of%20Equal%20Weight%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1053.%20Path%20of%20Equal%20Weight%20(30)/Solution.md)| |[1054. The Dominant Color (20)](https://www.patest.cn/contests/pat-a-practise/1054)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1054.%20The%20Dominant%20Color%20(20)/1054.%20The%20Dominant%20Color%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1054.%20The%20Dominant%20Color%20(20)/Solution.md)| |[1055. The World's Richest (25)](https://www.patest.cn/contests/pat-a-practise/1055)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1055.%20The%20World's%20Richest%20(25)/1055.%20The%20World's%20Richest%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1055.%20The%20World's%20Richest%20(25)/Solution.md)| |[1056. Mice and Rice (25)](https://www.patest.cn/contests/pat-a-practise/1056)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1056.%20Mice%20and%20Rice%20(25)/1056.%20Mice%20and%20Rice%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1056.%20Mice%20and%20Rice%20(25)/Solution.md)| |[1057. Stack (30)](https://www.patest.cn/contests/pat-a-practise/1057)|-|-| |[1058. A+B in Hogwarts (20)](https://www.patest.cn/contests/pat-a-practise/1058)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1058.%20A+B%20in%20Hogwarts%20(20)/1058.%20A+B%20in%20Hogwarts%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1058.%20A+B%20in%20Hogwarts%20(20)/Solution.md)| |[1059. Prime Factors (25)](https://www.patest.cn/contests/pat-a-practise/1059)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1059.%20Prime%20Factors%20(25)/1059.%20Prime%20Factors%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1059.%20Prime%20Factors%20(25)/Solution.md)| |[1060. Are They Equal (25)](https://www.patest.cn/contests/pat-a-practise/1060)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1060.%20Are%20They%20Equal%20(25)/1060.%20Are%20They%20Equal%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1060.%20Are%20They%20Equal%20(25)/Solution.md)| |[1061. Dating (20)](https://www.patest.cn/contests/pat-a-practise/1061)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1061.%20Dating%20(20)/1061.%20Dating%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1061.%20Dating%20(20)/Solution.md)| |[1062. Talent and Virtue (25)](https://www.patest.cn/contests/pat-a-practise/1062)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1062.%20Talent%20and%20Virtue%20(25)/1062.%20Talent%20and%20Virtue%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1062.%20Talent%20and%20Virtue%20(25)/Solution.md)| |[1063. Set Similarity (25)](https://www.patest.cn/contests/pat-a-practise/1063)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1063.%20Set%20Similarity%20(25)/1063.%20Set%20Similarity%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1063.%20Set%20Similarity%20(25)/Solution.md)| |[1064. Complete Binary Search Tree (30)](https://www.patest.cn/contests/pat-a-practise/1064)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1064.%20Complete%20Binary%20Search%20Tree%20(30)/1064.%20Complete%20Binary%20Search%20Tree%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1064.%20Complete%20Binary%20Search%20Tree%20(30)/Solution.md)| |[1065. A+B and C (64bit) (20)](https://www.patest.cn/contests/pat-a-practise/1065)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1065.%20A+B%20and%20C%20(64bit)%20(20)/1065.%20A+B%20and%20C%20(64bit)%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1065.%20A+B%20and%20C%20(64bit)%20(20)/Solution.md)| |[1066. Root of AVL Tree (25)](https://www.patest.cn/contests/pat-a-practise/1066)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1066.%20Root%20of%20AVL%20Tree%20(25)/1066.%20Root%20of%20AVL%20Tree%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1066.%20Root%20of%20AVL%20Tree%20(25)/Solution.md)| |[1067. Sort with Swap(0,*) (25)](https://www.patest.cn/contests/pat-a-practise/1067)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1067.%20Sort%20with%20Swap(0,*)%20(25)/1067.%20Sort%20with%20Swap(0,*)%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1067.%20Sort%20with%20Swap(0,*)%20(25)/Solution.md)| |[1068. Find More Coins (30)](https://www.patest.cn/contests/pat-a-practise/1068)|-|-| |[1069. The Black Hole of Numbers (20)](https://www.patest.cn/contests/pat-a-practise/1069)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1069.%20The%20Black%20Hole%20of%20Numbers%20(20)/1069.%20The%20Black%20Hole%20of%20Numbers%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1069.%20The%20Black%20Hole%20of%20Numbers%20(20)/Solution.md)| |[1070. Mooncake (25)](https://www.patest.cn/contests/pat-a-practise/1070)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1070.%20Mooncake%20(25)/1070.%20Mooncake%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1070.%20Mooncake%20(25)/Solution.md)| |[1071. Speech Patterns (25)](https://www.patest.cn/contests/pat-a-practise/1071)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1071.%20Speech%20Patterns%20(25)/1071.%20Speech%20Patterns%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1071.%20Speech%20Patterns%20(25)/Solution.md)| |[1072. Gas Station (30)](https://www.patest.cn/contests/pat-a-practise/1072)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1072.%20Gas%20Station%20(30)/1072.%20Gas%20Station%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1072.%20Gas%20Station%20(30)/Solution.md)| |[1073. Scientific Notation (20)](https://www.patest.cn/contests/pat-a-practise/1073)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1073.%20Scientific%20Notation%20(20)/1073.%20Scientific%20Notation%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1073.%20Scientific%20Notation%20(20)/Solution.md)| |[1074. Reversing Linked List (25)](https://www.patest.cn/contests/pat-a-practise/1074)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1074.%20Reversing%20Linked%20List%20(25)/1074.%20Reversing%20Linked%20List%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1074.%20Reversing%20Linked%20List%20(25)/Solution.md)| |[1075. PAT Judge (25)](https://www.patest.cn/contests/pat-a-practise/1075)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1075.%20PAT%20Judge%20(25)/1075.%20PAT%20Judge%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1075.%20PAT%20Judge%20(25)/Solution.md)| |[1076. Forwards on Weibo (30)](https://www.patest.cn/contests/pat-a-practise/1076)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1076.%20Forwards%20on%20Weibo%20(30)/1076.%20Forwards%20on%20Weibo%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1076.%20Forwards%20on%20Weibo%20(30)/Solution.md)| |[1077. Kuchiguse (20)](https://www.patest.cn/contests/pat-a-practise/1077)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1077.%20Kuchiguse%20(20)/1077.%20Kuchiguse%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1077.%20Kuchiguse%20(20)/Solution.md)| |[1078. Hashing (25)](https://www.patest.cn/contests/pat-a-practise/1078)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1078.%20Hashing%20(25)/1078.%20Hashing%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1078.%20Hashing%20(25)/Solution.md)| |[1079. Total Sales of Supply Chain (25)](https://www.patest.cn/contests/pat-a-practise/1079)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1079.%20Total%20Sales%20of%20Supply%20Chain%20(25)/1079.%20Total%20Sales%20of%20Supply%20Chain%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1079.%20Total%20Sales%20of%20Supply%20Chain%20(25)/Solution.md)| |[1080. Graduate Admission (30)](https://www.patest.cn/contests/pat-a-practise/1080)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1080.%20Graduate%20Admission%20(30)/1080.%20Graduate%20Admission%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1080.%20Graduate%20Admission%20(30)/Solution.md)| |[1081. Rational Sum (20)](https://www.patest.cn/contests/pat-a-practise/1081)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1081.%20Rational%20Sum%20(20)/1081.%20Rational%20Sum%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1081.%20Rational%20Sum%20(20)/Solution.md)| |[1082. Read Number in Chinese (25)](https://www.patest.cn/contests/pat-a-practise/1082)|-|-| |[1083. List Grades (25)](https://www.patest.cn/contests/pat-a-practise/1083)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1083.%20List%20Grades%20(25)/1083.%20List%20Grades%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1083.%20List%20Grades%20(25)/Solution.md)| |[1084. Broken Keyboard (20)](https://www.patest.cn/contests/pat-a-practise/1084)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1084.%20Broken%20Keyboard%20(20)/1084.%20Broken%20Keyboard%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1084.%20Broken%20Keyboard%20(20)/Solution.md)| |[1085. Perfect Sequence (25)](https://www.patest.cn/contests/pat-a-practise/1085)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1085.%20Perfect%20Sequence%20(25)/1085.%20Perfect%20Sequence%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1085.%20Perfect%20Sequence%20(25)/Solution.md)| |[1086. Tree Traversals Again (25)](https://www.patest.cn/contests/pat-a-practise/1086)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1086.%20Tree%20Traversals%20Again%20(25)/1086.%20Tree%20Traversals%20Again%20(25).cpp)/[Java](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1086.%20Tree%20Traversals%20Again%20(25)/TreeTraversalsAgain.java)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1086.%20Tree%20Traversals%20Again%20(25)/Solution.md)| |[1087. All Roads Lead to Rome (30)](https://www.patest.cn/contests/pat-a-practise/1087)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1087.%20All%20Roads%20Lead%20to%20Rome%20(30)/1087.%20All%20Roads%20Lead%20to%20Rome%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1087.%20All%20Roads%20Lead%20to%20Rome%20(30)/Solution.md)| |[1088. Rational Arithmetic (20)](https://www.patest.cn/contests/pat-a-practise/1088)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1088.%20Rational%20Arithmetic%20(20)/1088.%20Rational%20Arithmetic%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1088.%20Rational%20Arithmetic%20(20)/Solution.md)| |[1089. Insert or Merge (25)](https://www.patest.cn/contests/pat-a-practise/1089)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1089.%20Insert%20or%20Merge%20(25)/1089.%20Insert%20or%20Merge%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1089.%20Insert%20or%20Merge%20(25)/Solution.md)| |[1090. Highest Price in Supply Chain (25)](https://www.patest.cn/contests/pat-a-practise/1090)|[C++(DFS)](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1090.%20Highest%20Price%20in%20Supply%20Chain%20(25)/1090.%20Highest%20Price%20in%20Supply%20Chain%20(25)_DFS.cpp)/[C++(BFS)](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1090.%20Highest%20Price%20in%20Supply%20Chain%20(25)/1090.%20Highest%20Price%20in%20Supply%20Chain%20(25)_BFS.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1090.%20Highest%20Price%20in%20Supply%20Chain%20(25)/Solution.md)| |[1091. Acute Stroke (30)](https://www.patest.cn/contests/pat-a-practise/1091)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1091.%20Acute%20Stroke%20(30)/1091.%20Acute%20Stroke%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1091.%20Acute%20Stroke%20(30)/Solution.md)| |[1092. To Buy or Not to Buy (20)](https://www.patest.cn/contests/pat-a-practise/1092)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1092.%20To%20Buy%20or%20Not%20to%20Buy%20(20)/1092.%20To%20Buy%20or%20Not%20to%20Buy%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1092.%20To%20Buy%20or%20Not%20to%20Buy%20(20)/Solution.md)| |[1093. Count PAT's (25)](https://www.patest.cn/contests/pat-a-practise/1093)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1093.%20Count%20PAT's%20(25)/1093.%20Count%20PAT's%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1093.%20Count%20PAT's%20(25)/Solution.md)| |[1094. The Largest Generation (25)](https://www.patest.cn/contests/pat-a-practise/1094)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1094.%20The%20Largest%20Generation%20(25)/1094.%20The%20Largest%20Generation%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1094.%20The%20Largest%20Generation%20(25)/Solution.md)| |[1095. Cars on Campus (30)](https://www.patest.cn/contests/pat-a-practise/1095)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1095.%20Cars%20on%20Campus%20(30)/1095.%20Cars%20on%20Campus%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1095.%20Cars%20on%20Campus%20(30)/Solution.md)| |[1096. Consecutive Factors (20)](https://www.patest.cn/contests/pat-a-practise/1096)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1096.%20Consecutive%20Factors%20(20)/1096.%20Consecutive%20Factors%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1096.%20Consecutive%20Factors%20(20)/Solution.md)| |[1097. Deduplication on a Linked List (25)](https://www.patest.cn/contests/pat-a-practise/1097)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1097.%20Deduplication%20on%20a%20Linked%20List%20(25)/1097.%20Deduplication%20on%20a%20Linked%20List%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1097.%20Deduplication%20on%20a%20Linked%20List%20(25)/Solution.md)| |[1098. Insertion or Heap Sort (25)](https://www.patest.cn/contests/pat-a-practise/1098)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1098.%20Insertion%20or%20Heap%20Sort%20(25)/1098.%20Insertion%20or%20Heap%20Sort%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1098.%20Insertion%20or%20Heap%20Sort%20(25)/Solution.md)| |[1099. Build A Binary Search Tree (30)](https://www.patest.cn/contests/pat-a-practise/1099)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1099.%20Build%20A%20Binary%20Search%20Tree%20(30)/1099.%20Build%20A%20Binary%20Search%20Tree%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1099.%20Build%20A%20Binary%20Search%20Tree%20(30)/Solution.md)| |[1100. Mars Numbers (20)](https://www.patest.cn/contests/pat-a-practise/1100)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1100.%20Mars%20Numbers%20(20)/1100.%20Mars%20Numbers%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1100.%20Mars%20Numbers%20(20)/Solution.md)| |[1101. Quick Sort (25)](https://www.patest.cn/contests/pat-a-practise/1101)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1101.%20Quick%20Sort%20(25)/1101.%20Quick%20Sort%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1101.%20Quick%20Sort%20(25)/Solution.md)| |[1102. Invert a Binary Tree (25)](https://www.patest.cn/contests/pat-a-practise/1102)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1102.%20Invert%20a%20Binary%20Tree%20(25)/1102.%20Invert%20a%20Binary%20Tree%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1102.%20Invert%20a%20Binary%20Tree%20(25)/Solution.md)| |[1103. Integer Factorization (30)](https://www.patest.cn/contests/pat-a-practise/1103)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1103.%20Integer%20Factorization%20(30)/1103.%20Integer%20Factorization%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1103.%20Integer%20Factorization%20(30)/Solution.md)| |[1104. Sum of Number Segments (20)](https://www.patest.cn/contests/pat-a-practise/1104)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1104.%20Sum%20of%20Number%20Segments%20(20)/1104.%20Sum%20of%20Number%20Segments%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1104.%20Sum%20of%20Number%20Segments%20(20)/Solution.md)| |[1105. Spiral Matrix (25)](https://www.patest.cn/contests/pat-a-practise/1105)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1105.%20Spiral%20Matrix%20(25)/1105.%20Spiral%20Matrix%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1105.%20Spiral%20Matrix%20(25)/Solution.md)| |[1106. Lowest Price in Supply Chain (25)](https://www.patest.cn/contests/pat-a-practise/1106)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1106.%20Lowest%20Price%20in%20Supply%20Chain%20(25)/1106.%20Lowest%20Price%20in%20Supply%20Chain%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1106.%20Lowest%20Price%20in%20Supply%20Chain%20(25)/Solution.md)| |[1107. Social Clusters (30)](https://www.patest.cn/contests/pat-a-practise/1107)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1107.%20Social%20Clusters%20(30)/1107.%20Social%20Clusters%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1107.%20Social%20Clusters%20(30)/Solution.md)| |[1108. Finding Average (20)](https://www.patest.cn/contests/pat-a-practise/1108)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1108.%20Finding%20Average%20(20)/1108.%20Finding%20Average%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1108.%20Finding%20Average%20(20)/Solution.md)| |[1109. Group Photo (25)](https://www.patest.cn/contests/pat-a-practise/1109)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1109.%20Group%20Photo%20(25)/1109.%20Group%20Photo%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1109.%20Group%20Photo%20(25)/Solution.md)| |[1110. Complete Binary Tree (25)](https://www.patest.cn/contests/pat-a-practise/1110)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1110.%20Complete%20Binary%20Tree%20(25)/1110.%20Complete%20Binary%20Tree%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1110.%20Complete%20Binary%20Tree%20(25)/Solution.md)| |[1111. Online Map (30)](https://www.patest.cn/contests/pat-a-practise/1111)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1111.%20Online%20Map%20(30)/1111.%20Online%20Map%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1111.%20Online%20Map%20(30)/Solution.md)| |[1112. Stucked Keyboard (20)](https://www.patest.cn/contests/pat-a-practise/1112)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1112.%20Stucked%20Keyboard%20(20)/1112.%20Stucked%20Keyboard%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1112.%20Stucked%20Keyboard%20(20)/Solution.md)| |[1113. Integer Set Partition (25)](https://www.patest.cn/contests/pat-a-practise/1113)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1113.%20Integer%20Set%20Partition%20(25)/1113.%20Integer%20Set%20Partition%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1113.%20Integer%20Set%20Partition%20(25)/Solution.md)| |[1114. Family Property (25)](https://www.patest.cn/contests/pat-a-practise/1114)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1114.%20Family%20Property%20(25)/1114.%20Family%20Property%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1114.%20Family%20Property%20(25)/Solution.md)| |[1115. Counting Nodes in a BST (30)](https://www.patest.cn/contests/pat-a-practise/1115)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1115.%20Counting%20Nodes%20in%20a%20BST%20(30)/1115.%20Counting%20Nodes%20in%20a%20BST%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1115.%20Counting%20Nodes%20in%20a%20BST%20(30)/Solution.md)| |[1116. Come on! Let's C (20)](https://www.patest.cn/contests/pat-a-practise/1116)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1116.%20Come%20on!%20Let's%20C%20(20)/1116.%20Come%20on!%20Let's%20C%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1116.%20Come%20on!%20Let's%20C%20(20)/Solution.md)| |[1117. Eddington Number(25)](https://www.patest.cn/contests/pat-a-practise/1117)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1117.%20Eddington%20Number(25)/1117.%20Eddington%20Number(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1117.%20Eddington%20Number(25)/Solution.md)| |[1118. Birds in Forest (25)](https://www.patest.cn/contests/pat-a-practise/1118)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1118.%20Birds%20in%20Forest%20(25)/1118.%20Birds%20in%20Forest%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1118.%20Birds%20in%20Forest%20(25)/Solution.md)| |[1119. Pre- and Post-order Traversals(30)](https://www.patest.cn/contests/pat-a-practise/1119)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1119.%20Pre-%20and%20Post-order%20Traversals%20(30)/1119.%20Pre-%20and%20Post-order%20Traversals%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1119.%20Pre-%20and%20Post-order%20Traversals%20(30)/Solution.md)| |[1120. Friend Numbers (20)](https://www.patest.cn/contests/pat-a-practise/1120)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1120.%20Friend%20Numbers%20(20)/1120.%20Friend%20Numbers%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1120.%20Friend%20Numbers%20(20)/Solution.md)| |[1121. Damn Single (25)](https://www.patest.cn/contests/pat-a-practise/1121)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1121.%20Damn%20Single%20(25)/1121.%20Damn%20Single%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1121.%20Damn%20Single%20(25)/Solution.md)| |[1122. Hamiltonian Cycle (25)](https://www.patest.cn/contests/pat-a-practise/1122)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1122.%20Hamiltonian%20Cycle%20(25)/1122.%20Hamiltonian%20Cycle%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1122.%20Hamiltonian%20Cycle%20(25)/Solution.md)| |[1123. Is It a Complete AVL Tree (30)](https://www.patest.cn/contests/pat-a-practise/1123)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1123.%20Is%20It%20a%20Complete%20AVL%20Tree%20(30)/1123.%20Is%20It%20a%20Complete%20AVL%20Tree%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1123.%20Is%20It%20a%20Complete%20AVL%20Tree%20(30)/Solution.md)| |[1124. Raffle for Weibo Followers (20)](https://www.patest.cn/contests/pat-a-practise/1124)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1124.%20Raffle%20for%20Weibo%20Followers%20(20)/1124.%20Raffle%20for%20Weibo%20Followers%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1124.%20Raffle%20for%20Weibo%20Followers%20(20)/Solution.md)| |[1125. Chain the Ropes (25)](https://www.patest.cn/contests/pat-a-practise/1125)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1125.%20Chain%20the%20Ropes%20(25)/1125.%20Chain%20the%20Ropes%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1125.%20Chain%20the%20Ropes%20(25)/Solution.md)| |[1126. Eulerian Path (25)](https://www.patest.cn/contests/pat-a-practise/1126)|[c++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1126.%20Eulerian%20Path%20(25)/1126.%20Eulerian%20Path%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1126.%20Eulerian%20Path%20(25)/Solution.md)| |[1127. ZigZagging on a Tree (30)](https://www.patest.cn/contests/pat-a-practise/1127)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1127.%20ZigZagging%20on%20a%20Tree%20(30)/1127.%20ZigZagging%20on%20a%20Tree%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1127.%20ZigZagging%20on%20a%20Tree%20(30)/Solution.md)| |[1128. N Queens Puzzle (20)](https://www.patest.cn/contests/pat-a-practise/1128)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1128.%20N%20Queens%20Puzzle%20(20)/1128.%20N%20Queens%20Puzzle%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1128.%20N%20Queens%20Puzzle%20(20)/Solution.md)| |[1129. Recommendation System (25)](https://www.patest.cn/contests/pat-a-practise/1129)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1129.%20Recommendation%20System%20(25)/1129.%20Recommendation%20System%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1129.%20Recommendation%20System%20(25)/Solution.md)| |[1130. Infix Expression (25)](https://www.patest.cn/contests/pat-a-practise/1130)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1130.%20Infix%20Expression%20(25)/1130.%20Infix%20Expression%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1130.%20Infix%20Expression%20(25)/Solution.md)| |[1131. Subway Map (30)](https://www.patest.cn/contests/pat-a-practise/1131)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1131.%20Subway%20Map%20(30)/1131.%20Subway%20Map%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1131.%20Subway%20Map%20(30)/Solution.md)| |[1132. Cut Integer (20)](https://www.patest.cn/contests/pat-a-practise/1132)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1132.%20Cut%20Integer%20(20)/1132.%20Cut%20Integer%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1132.%20Cut%20Integer%20(20)/Solution.md)| |[1133. Splitting A Linked List (25)](https://www.patest.cn/contests/pat-a-practise/1133)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1133.%20Splitting%20A%20Linked%20List%20(25)/1133.%20Splitting%20A%20Linked%20List%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1133.%20Splitting%20A%20Linked%20List%20(25)/Solution.md)| |[1134. Vertex Cover (25)](https://www.patest.cn/contests/pat-a-practise/1134)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1134.%20Vertex%20Cover%20(25)/1134.%20Vertex%20Cover%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1134.%20Vertex%20Cover%20(25)/Solution.md)| |[1135. Is It A Red-Black Tree (30)](https://www.patest.cn/contests/pat-a-practise/1135)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1135.%20Is%20It%20A%20Red-Black%20Tree%20(30)/1135.%20Is%20It%20A%20Red-Black%20Tree%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1135.%20Is%20It%20A%20Red-Black%20Tree%20(30)/Solution.md)| |[1136. A Delayed Palindrome (20)](https://www.patest.cn/contests/pat-a-practise/1136)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1136.%20A%20Delayed%20Palindrome%20(20)/1136.%20A%20Delayed%20Palindrome%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1136.%20A%20Delayed%20Palindrome%20(20)/Solution.md)| |[1137. Final Grading (25)](https://www.patest.cn/contests/pat-a-practise/1137)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1137.%20Final%20Grading%20(25)/1137.%20Final%20Grading%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1137.%20Final%20Grading%20(25)/Solution.md)| |[1138. Postorder Traversal (25)](https://www.patest.cn/contests/pat-a-practise/1138)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1138.%20Postorder%20Traversal%20(25)/1138.%20Postorder%20Traversal%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1138.%20Postorder%20Traversal%20(25)/Solution.md)| |[1139. First Contact (30)](https://www.patest.cn/contests/pat-a-practise/1139)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1139.%20First%20Contact%20(30)/1139.%20First%20Contact%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1139.%20First%20Contact%20(30)/Solution.md)| |[1140. Look-and-say Sequence (20)](https://www.patest.cn/contests/pat-a-practise/1140)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1140.%20Look-and-say%20Sequence%20(20)/1140.%20Look-and-say%20Sequence%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1140.%20Look-and-say%20Sequence%20(20)/Solution.md)| |[1141. PAT Ranking of Institutions (25)](https://www.patest.cn/contests/pat-a-practise/1141)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1141.%20PAT%20Ranking%20of%20Institutions%20(25)/1141.%20PAT%20Ranking%20of%20Institutions%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1141.%20PAT%20Ranking%20of%20Institutions%20(25)/Solution.md)| |[1142. Maximal Clique (25)](https://www.patest.cn/contests/pat-a-practise/1142)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1142.%20Maximal%20Clique%20(25)/1142.%20Maximal%20Clique%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1142.%20Maximal%20Clique%20(25)/Solution.md)| |[1143. Lowest Common Ancestor (30)](https://www.patest.cn/contests/pat-a-practise/1143)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1143.%20Lowest%20Common%20Ancestor%20(30)/1143.%20Lowest%20Common%20Ancestor%20(30).cpp)/[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1143.%20Lowest%20Common%20Ancestor%20(30)/1143.%20Lowest%20Common%20Ancestor%20(30)_2.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1143.%20Lowest%20Common%20Ancestor%20(30)/Solution.md)| |[1144. The Missing Number (20)](https://www.patest.cn/contests/pat-a-practise/1144)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1144.%20The%20Missing%20Number%20(20)/1144.%20The%20Missing%20Number%20(20).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1144.%20The%20Missing%20Number%20(20)/Solution.md)| |[1145. Hashing - Average Search Time (25)](https://www.patest.cn/contests/pat-a-practise/1145)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1145.%20Hashing%20-%20Average%20Search%20Time%20(25)/1145.%20Hashing%20-%20Average%20Search%20Time%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1145.%20Hashing%20-%20Average%20Search%20Time%20(25)/Solution.md)| |[1146. Topological Order (25)](https://www.patest.cn/contests/pat-a-practise/1146)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1146.%20Topological%20Order%20(25)/1146.%20Topological%20Order%20(25).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1146.%20Topological%20Order%20(25)/Solution.md)| |[1147. Heaps (30)](https://www.patest.cn/contests/pat-a-practise/1147)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1147.%20Heaps%20(30)/1147.%20Heaps%20(30).cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/PAT%20Advanced%20Level%20Practise/1147.%20Heaps%20(30)/Solution.md)| ### 甲级满分  ## [团体程序设计天梯赛-练习集](https://pintia.cn/problem-sets/994805046380707840/problems) |标号|标题|code|题解| |---|---|---|---| |L1-001|[Hello World](https://pintia.cn/problem-sets/994805046380707840/problems/994805147132084224)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L1-001%20Hello%20World%20%EF%BC%885%20%E5%88%86%EF%BC%89/L1-001%20Hello%20World%20%EF%BC%885%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PTA/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L1-001%20Hello%20World%20%EF%BC%885%20%E5%88%86%EF%BC%89/Solution.md)| |L1-002|[打印沙漏](https://pintia.cn/problem-sets/994805046380707840/problems/994805145370476544)|[C](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L1-002%20%E6%89%93%E5%8D%B0%E6%B2%99%E6%BC%8F%20%EF%BC%8820%20%E5%88%86%EF%BC%89/L1-002%20%E6%89%93%E5%8D%B0%E6%B2%99%E6%BC%8F%20%EF%BC%8820%20%E5%88%86%EF%BC%89.c)|-| |L1-003|[个位数统计](https://pintia.cn/problem-sets/994805046380707840/problems/994805143738892288)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L1-003%20%E4%B8%AA%E4%BD%8D%E6%95%B0%E7%BB%9F%E8%AE%A1%20%EF%BC%8815%20%E5%88%86%EF%BC%89/L1-003%20%E4%B8%AA%E4%BD%8D%E6%95%B0%E7%BB%9F%E8%AE%A1%20%EF%BC%8815%20%E5%88%86%EF%BC%89.cpp)|-| |L1-004|[计算摄氏温度](https://pintia.cn/problem-sets/994805046380707840/problems/994805142086336512)|[C](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L1-004%20%E8%AE%A1%E7%AE%97%E6%91%84%E6%B0%8F%E6%B8%A9%E5%BA%A6%20%EF%BC%885%20%E5%88%86%EF%BC%89/L1-004%20%E8%AE%A1%E7%AE%97%E6%91%84%E6%B0%8F%E6%B8%A9%E5%BA%A6%20%EF%BC%885%20%E5%88%86%EF%BC%89.c)|-| |L1-005|[考试座位号](https://pintia.cn/problem-sets/994805046380707840/problems/994805140211482624)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L1-005%20%E8%80%83%E8%AF%95%E5%BA%A7%E4%BD%8D%E5%8F%B7%20%EF%BC%8815%20%E5%88%86%EF%BC%89/L1-005%20%E8%80%83%E8%AF%95%E5%BA%A7%E4%BD%8D%E5%8F%B7%20%EF%BC%8815%20%E5%88%86%EF%BC%89.cpp)|-| |L1-007|[念数字](https://pintia.cn/problem-sets/994805046380707840/problems/994805136889593856)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L1-007%20%E5%BF%B5%E6%95%B0%E5%AD%97%20%EF%BC%8810%20%E5%88%86%EF%BC%89/L1-007%20%E5%BF%B5%E6%95%B0%E5%AD%97%20%EF%BC%8810%20%E5%88%86%EF%BC%89.cpp)|-| |L1-008|[求整数段和](https://pintia.cn/problem-sets/994805046380707840/problems/994805135224455168)|[C](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L1-008%20%E6%B1%82%E6%95%B4%E6%95%B0%E6%AE%B5%E5%92%8C%20%EF%BC%8810%20%E5%88%86%EF%BC%89/L1-008%20%E6%B1%82%E6%95%B4%E6%95%B0%E6%AE%B5%E5%92%8C%20%EF%BC%8810%20%E5%88%86%EF%BC%89.c)|-| |L1-010|[比较大小](https://pintia.cn/problem-sets/994805046380707840/problems/994805132040978432)|[C](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L1-010%20%E6%AF%94%E8%BE%83%E5%A4%A7%E5%B0%8F%20%EF%BC%8810%20%E5%88%86%EF%BC%89/L1-010%20%E6%AF%94%E8%BE%83%E5%A4%A7%E5%B0%8F%20%EF%BC%8810%20%E5%88%86%EF%BC%89.c)|-| |L2-001|[紧急救援](https://pintia.cn/problem-sets/994805046380707840/problems/994805073643683840)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-001%20%E7%B4%A7%E6%80%A5%E6%95%91%E6%8F%B4%20%EF%BC%8825%20%E5%88%86%EF%BC%89/L2-001%20%E7%B4%A7%E6%80%A5%E6%95%91%E6%8F%B4%20%EF%BC%8825%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-001%20%E7%B4%A7%E6%80%A5%E6%95%91%E6%8F%B4%20%EF%BC%8825%20%E5%88%86%EF%BC%89/Solution.md)| |L2-004|[这是一颗二叉搜索树吗](https://pintia.cn/problem-sets/994805046380707840/problems/994805070971912192)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-004%20%E8%BF%99%E6%98%AF%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E5%90%97%EF%BC%9F%20%EF%BC%8825%20%E5%88%86%EF%BC%89/L2-004%20%E8%BF%99%E6%98%AF%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E5%90%97%EF%BC%9F%20%EF%BC%8825%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-004%20%E8%BF%99%E6%98%AF%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E5%90%97%EF%BC%9F%20%EF%BC%8825%20%E5%88%86%EF%BC%89/Solution.md)| |L2-006|[树的遍历](https://pintia.cn/problem-sets/994805046380707840/problems/994805069361299456)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-006%20%E6%A0%91%E7%9A%84%E9%81%8D%E5%8E%86%20%EF%BC%8825%20%E5%88%86%EF%BC%89/L2-006%20%E6%A0%91%E7%9A%84%E9%81%8D%E5%8E%86%20%EF%BC%8825%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-006%20%E6%A0%91%E7%9A%84%E9%81%8D%E5%8E%86%20%EF%BC%8825%20%E5%88%86%EF%BC%89/Solution.md)| |L2-007|[家庭房产](https://pintia.cn/problem-sets/994805046380707840/problems/994805068539215872)|[C++(BFS)](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-007%20%E5%AE%B6%E5%BA%AD%E6%88%BF%E4%BA%A7%20%EF%BC%8825%20%E5%88%86%EF%BC%89/L2-007%20%E5%AE%B6%E5%BA%AD%E6%88%BF%E4%BA%A7%20%EF%BC%8825%20%E5%88%86%EF%BC%89_BFS.cpp)/[C++(并查集)](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-007%20%E5%AE%B6%E5%BA%AD%E6%88%BF%E4%BA%A7%20%EF%BC%8825%20%E5%88%86%EF%BC%89/L2-007%20%E5%AE%B6%E5%BA%AD%E6%88%BF%E4%BA%A7%20%EF%BC%8825%20%E5%88%86%EF%BC%89_%E5%B9%B6%E6%9F%A5%E9%9B%86.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-007%20%E5%AE%B6%E5%BA%AD%E6%88%BF%E4%BA%A7%20%EF%BC%8825%20%E5%88%86%EF%BC%89/Solution.md)| |L2-011|[玩转二叉树](https://pintia.cn/problem-sets/994805046380707840/problems/994805065406070784)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-011%20%E7%8E%A9%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91%20%EF%BC%8825%20%E5%88%86%EF%BC%89/L2-011%20%E7%8E%A9%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91%20%EF%BC%8825%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-011%20%E7%8E%A9%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91%20%EF%BC%8825%20%E5%88%86%EF%BC%89/Solution.md)| |L2-012|[关于堆的判断](https://pintia.cn/problem-sets/994805046380707840/problems/994805064676261888)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-012%20%E5%85%B3%E4%BA%8E%E5%A0%86%E7%9A%84%E5%88%A4%E6%96%AD%20%EF%BC%8825%20%E5%88%86%EF%BC%89/L2-012%20%E5%85%B3%E4%BA%8E%E5%A0%86%E7%9A%84%E5%88%A4%E6%96%AD%20%EF%BC%8825%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-012%20%E5%85%B3%E4%BA%8E%E5%A0%86%E7%9A%84%E5%88%A4%E6%96%AD%20%EF%BC%8825%20%E5%88%86%EF%BC%89/Solution.md)| |L2-013|[红色警报](https://pintia.cn/problem-sets/994805046380707840/problems/994805063963230208)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-013%20%E7%BA%A2%E8%89%B2%E8%AD%A6%E6%8A%A5%20%EF%BC%8825%20%E5%88%86%EF%BC%89/L2-013%20%E7%BA%A2%E8%89%B2%E8%AD%A6%E6%8A%A5%20%EF%BC%8825%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-013%20%E7%BA%A2%E8%89%B2%E8%AD%A6%E6%8A%A5%20%EF%BC%8825%20%E5%88%86%EF%BC%89/Solution.md)| |L2-016|[愿天下有情人都是失散多年的兄妹](https://pintia.cn/problem-sets/994805046380707840/problems/994805061769609216)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-016%20%E6%84%BF%E5%A4%A9%E4%B8%8B%E6%9C%89%E6%83%85%E4%BA%BA%E9%83%BD%E6%98%AF%E5%A4%B1%E6%95%A3%E5%A4%9A%E5%B9%B4%E7%9A%84%E5%85%84%E5%A6%B9%20%EF%BC%8825%20%E5%88%86%EF%BC%89/L2-016%20%E6%84%BF%E5%A4%A9%E4%B8%8B%E6%9C%89%E6%83%85%E4%BA%BA%E9%83%BD%E6%98%AF%E5%A4%B1%E6%95%A3%E5%A4%9A%E5%B9%B4%E7%9A%84%E5%85%84%E5%A6%B9%20%EF%BC%8825%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-016%20%E6%84%BF%E5%A4%A9%E4%B8%8B%E6%9C%89%E6%83%85%E4%BA%BA%E9%83%BD%E6%98%AF%E5%A4%B1%E6%95%A3%E5%A4%9A%E5%B9%B4%E7%9A%84%E5%85%84%E5%A6%B9%20%EF%BC%8825%20%E5%88%86%EF%BC%89/Solution.md)| |L2-020|[功夫传人](https://pintia.cn/problem-sets/994805046380707840/problems/994805059118809088)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-020%20%E5%8A%9F%E5%A4%AB%E4%BC%A0%E4%BA%BA%20%EF%BC%8825%20%E5%88%86%EF%BC%89/L2-020%20%E5%8A%9F%E5%A4%AB%E4%BC%A0%E4%BA%BA%20%EF%BC%8825%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-020%20%E5%8A%9F%E5%A4%AB%E4%BC%A0%E4%BA%BA%20%EF%BC%8825%20%E5%88%86%EF%BC%89/Solution.md)| |L2-024|[部落](https://pintia.cn/problem-sets/994805046380707840/problems/994805056736444416)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-024%20%E9%83%A8%E8%90%BD%20%EF%BC%8825%20%E5%88%86%EF%BC%89/L2-024%20%E9%83%A8%E8%90%BD%20%EF%BC%8825%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-024%20%E9%83%A8%E8%90%BD%20%EF%BC%8825%20%E5%88%86%EF%BC%89/Solution.md)| |L2-025|[分而治之](https://pintia.cn/problem-sets/994805046380707840/problems/994805056195379200)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-025%20%E5%88%86%E8%80%8C%E6%B2%BB%E4%B9%8B%20%EF%BC%8825%20%E5%88%86%EF%BC%89/L2-025%20%E5%88%86%E8%80%8C%E6%B2%BB%E4%B9%8B%20%EF%BC%8825%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-025%20%E5%88%86%E8%80%8C%E6%B2%BB%E4%B9%8B%20%EF%BC%8825%20%E5%88%86%EF%BC%89/Solution.md)| |L2-026|[小字辈](https://pintia.cn/problem-sets/994805046380707840/problems/994805055679479808)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-026%20%E5%B0%8F%E5%AD%97%E8%BE%88%20%EF%BC%8825%20%E5%88%86%EF%BC%89/L2-026%20%E5%B0%8F%E5%AD%97%E8%BE%88%20%EF%BC%8825%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L2-026%20%E5%B0%8F%E5%AD%97%E8%BE%88%20%EF%BC%8825%20%E5%88%86%EF%BC%89/Solution.md)| |L3-003|[社交集群](https://pintia.cn/problem-sets/994805046380707840/problems/994805053141925888)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L3-003%20%E7%A4%BE%E4%BA%A4%E9%9B%86%E7%BE%A4%20%EF%BC%8830%20%E5%88%86%EF%BC%89/L3-003%20%E7%A4%BE%E4%BA%A4%E9%9B%86%E7%BE%A4%20%EF%BC%8830%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L3-003%20%E7%A4%BE%E4%BA%A4%E9%9B%86%E7%BE%A4%20%EF%BC%8830%20%E5%88%86%EF%BC%89/Solution.md)| |L3-005|[垃圾箱分布](https://pintia.cn/problem-sets/994805046380707840/problems/994805052131098624)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L3-005%20%E5%9E%83%E5%9C%BE%E7%AE%B1%E5%88%86%E5%B8%83%20%EF%BC%8830%20%E5%88%86%EF%BC%89/L3-005%20%E5%9E%83%E5%9C%BE%E7%AE%B1%E5%88%86%E5%B8%83%20%EF%BC%8830%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L3-005%20%E5%9E%83%E5%9C%BE%E7%AE%B1%E5%88%86%E5%B8%83%20%EF%BC%8830%20%E5%88%86%EF%BC%89/Solution.md)| |L3-007|[天梯地图](https://pintia.cn/problem-sets/994805046380707840/problems/994805051153825792)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L3-007%20%E5%A4%A9%E6%A2%AF%E5%9C%B0%E5%9B%BE%20%EF%BC%8830%20%E5%88%86%EF%BC%89/L3-007%20%E5%A4%A9%E6%A2%AF%E5%9C%B0%E5%9B%BE%20%EF%BC%8830%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L3-007%20%E5%A4%A9%E6%A2%AF%E5%9C%B0%E5%9B%BE%20%EF%BC%8830%20%E5%88%86%EF%BC%89/Solution.md)| |L3-008|[喊山](https://pintia.cn/problem-sets/994805046380707840/problems/994805050709229568)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L3-008%20%E5%96%8A%E5%B1%B1%20%EF%BC%8830%20%E5%88%86%EF%BC%89/L3-008%20%E5%96%8A%E5%B1%B1%20%EF%BC%8830%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L3-008%20%E5%96%8A%E5%B1%B1%20%EF%BC%8830%20%E5%88%86%EF%BC%89/Solution.md)| |L3-010|[是否完全二叉搜索树](https://pintia.cn/problem-sets/994805046380707840/problems/994805049870368768)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L3-010%E6%98%AF%E5%90%A6%E5%AE%8C%E5%85%A8%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%20(30%E5%88%86)/L3-010%20%E6%98%AF%E5%90%A6%E5%AE%8C%E5%85%A8%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%20%EF%BC%8830%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L3-010%E6%98%AF%E5%90%A6%E5%AE%8C%E5%85%A8%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%20(30%E5%88%86)/Solution.md)| |L3-011|[直捣黄龙](https://pintia.cn/problem-sets/994805046380707840/problems/994805049455132672)]|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L3-011%20%E7%9B%B4%E6%8D%A3%E9%BB%84%E9%BE%99%20%EF%BC%8830%20%E5%88%86%EF%BC%89/L3-011%20%E7%9B%B4%E6%8D%A3%E9%BB%84%E9%BE%99%20%EF%BC%8830%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L3-011%20%E7%9B%B4%E6%8D%A3%E9%BB%84%E9%BE%99%20%EF%BC%8830%20%E5%88%86%EF%BC%89/Solution.md)| |L3-015|[球队食物链](https://pintia.cn/problem-sets/994805046380707840/problems/994805048175869952)]|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L3-015%20%E7%90%83%E9%98%9F%E2%80%9C%E9%A3%9F%E7%89%A9%E9%93%BE%E2%80%9D%20%EF%BC%8830%20%E5%88%86%EF%BC%89/L3-015%20%E7%90%83%E9%98%9F%E2%80%9C%E9%A3%9F%E7%89%A9%E9%93%BE%E2%80%9D%20%EF%BC%8830%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L3-015%20%E7%90%83%E9%98%9F%E2%80%9C%E9%A3%9F%E7%89%A9%E9%93%BE%E2%80%9D%20%EF%BC%8830%20%E5%88%86%EF%BC%89/Solution.md)| |L3-016|[二叉搜索树的结构](https://pintia.cn/problem-sets/994805046380707840/problems/994805047903240192)|[C++](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L3-016%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E7%BB%93%E6%9E%84%20(30%E5%88%86)/L3-016%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E7%BB%93%E6%9E%84%20%EF%BC%8830%20%E5%88%86%EF%BC%89.cpp)|[Solution](https://github.com/jerrykcode/PAT-Practise/blob/master/%E5%9B%A2%E4%BD%93%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E5%A4%A9%E6%A2%AF%E8%B5%9B/L3-016%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E7%BB%93%E6%9E%84%20(30%E5%88%86)/Solution.md)|
