摘要：
The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants. A binary search tree (BST) i 阅读全文
摘要：
A clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. A maximal cliqueis a clique 阅读全文
摘要：
After each PAT, the PAT Center will announce the ranking of institutions based on their students' performances. Now you are asked to generate the rank 阅读全文
摘要：
Look-and-say sequence is a sequence of integers as the following: where D is in [0, 9] except 1. The (n+1)st number is a kind of description of the nt 阅读全文