1021 Deepest Root (25分) A graph which is connected and acyclic can be co...

1051 Pop Sequence (25分) Given a stack which can keep M numbers at most. ...

1097 Deduplication on a Linked List (25分) Given a singly linked list L w...

1074 Reversing Linked List (25分) Given a constant K and a singly linked ...

1062 Talent and Virtue (25分) About 900 years ago, a Chinese philosopher ...

1061 Dating (20分) Sherlock Holmes received a note with some strange stri...

1032 Sharing (25分) To store English words, one method is to use linked l...

1106 Lowest Price in Supply Chain (25分) A supply chain is a network of r...

1086 Tree Traversals Again (25分) An inorder binary tree traversal can be...