PAT - 随笔分类(第4页) - gaoren

1021. Deepest Root (25)

摘要：A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the 阅读全文

posted @ 2017-10-11 10:51 gaoren 阅读(141) 评论(0) 推荐(0)

1013. Battle Over Cities (25)

摘要：It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that c 阅读全文

posted @ 2017-10-10 09:39 gaoren 阅读(169) 评论(0) 推荐(0)

1020. Tree Traversals (25)

摘要：Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to ou 阅读全文

posted @ 2017-10-09 12:18 gaoren 阅读(235) 评论(1) 推荐(0)

1019. General Palindromic Number (20)

摘要：A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number 阅读全文

posted @ 2017-10-08 19:12 gaoren 阅读(422) 评论(0) 推荐(0)

1003. Emergency (25)

摘要：As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some ro 阅读全文

posted @ 2017-10-07 09:53 gaoren 阅读(166) 评论(0) 推荐(0)

1014. Waiting in Line (30)

摘要：Suppose a bank has N windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. The rules 阅读全文

posted @ 2017-10-06 16:25 gaoren 阅读(276) 评论(0) 推荐(0)

gaoren

随笔分类 - PAT

公告