摘要：
Source: PAT A1142 Maximal Clique (25 分) Description: A clique is a subset of vertices of an undirected graph such that every two distinct vertices in 阅读全文
摘要：
Source: PAT A1143 Lowest Common Ancestor (30 分) Description: The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that 阅读全文
摘要：
Source: PAT A1144 The Missing Number (20 分) Description: Given N integers, you are supposed to find the smallest positive integer that is NOT in the g 阅读全文
摘要：
Source: PAT A1145 Hashing - Average Search Time (25 分) Description: The task of this problem is simple: insert a sequence of distinct positive integer 阅读全文
摘要：
Source: PAT A1146 Topological Order (25 分) Description: This is a problem given in the Graduate Entrance Exam in 2018: Which of the following is NOT a 阅读全文
摘要：
Source: PAT A1147 Heaps (30 分) Description: In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: i 阅读全文
摘要：
Source: PAT A1076 Forwards on Weibo (30 分) Description: Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, a 阅读全文
摘要：
Source: PAT A1034 Head of a Gang (30 分) Description: One way that the police finds the head of a gang is to check people's phone calls. If there is a 阅读全文
摘要：
Source: PAT A1021 Deepest Root (25 分) Description: A graph which is connected and acyclic can be considered a tree. The height of the tree depends on 阅读全文
摘要：
Source: PAT A1013 Battle Over Cities (25 分) Description: It is vitally important to have all the cities connected by highways in a war. If a city is o 阅读全文