PAT解题思路
题号 | 题目 | 分值 | 关键字 |
---|---|---|---|
1001 | A+B Format | 20 | 无 |
1002 | A+B for Polynomials | 25 | TwoPointers |
1004 | Counting Leaves | 30 | 树 |
1005 | Spell It Right | 20 | 字符串 map |
1006 | Sign In and Sign Out | 25 | 字符串 排序 |
1007 | Maximum Subsequence Sum | 25 | 最大和子序列 |
1008 | Elevator | 20 | 无 |
1020 | Tree Traversals | 25 | 中序遍历 后序遍历 层次遍历 中序后序建树 |
1025 | PAT Ranking | 25 | 排序 |
1032 | Sharing | 25 | 静态链表 |
1043 | Is It a Binary Search Tree | 25 | BST 建树 先序遍历 后序遍历 |
1052 | Linked List Sorting | 25 | 静态链表 排序 |
1053 | Path of Equal Weight | 30 | DFS 剪枝 |
1059 | Prime Factors | 25 | 素数表 |
1060 | Are They Equal | 25 | 字符串 |
1066 | Root of AVL Tree | 25 | AVL树 模板题📐 |
1069 | The Black Hole of Numbers | 20 | 字符串 |
1093 | Count PAT's | 25 | TwoPointers 递推 |
1101 | Quick Sort | 25 | TwoPointers 递推 |
1107 | Social Clusters | 30 | 并查集 模板题📐 |