随笔分类 -  Pat

1 2 3 4 下一页
1113 Integer Set Partition (25 分)
摘要：1113 Integer Set Partition (25 分) 1113 Integer Set Partition (25 分) 1113 Integer Set Partition (25 分) Given a set of N (>) positive integers, you are 阅读全文
posted @ 2019-08-11 12:11 #忘乎所以# 阅读(215) 评论(0) 推荐(0)
1115 Counting Nodes in a BST (30 分)
摘要：1115 Counting Nodes in a BST (30 分) 1115 Counting Nodes in a BST (30 分) 1115 Counting Nodes in a BST (30 分) A Binary Search Tree (BST) is recursively 阅读全文
posted @ 2019-08-11 01:21 #忘乎所以# 阅读(185) 评论(0) 推荐(0)
1119 Pre- and Post-order Traversals (30 分)
摘要：1119 Pre- and Post-order Traversals (30 分) 1119 Pre- and Post-order Traversals (30 分) 1119 Pre- and Post-order Traversals (30 分) Suppose that all the 阅读全文
posted @ 2019-08-10 23:38 #忘乎所以# 阅读(225) 评论(0) 推荐(0)
1118 Birds in Forest (25 分)
摘要：1118 Birds in Forest (25 分) 1118 Birds in Forest (25 分) 1118 Birds in Forest (25 分) Some scientists took pictures of thousands of birds in a forest. A 阅读全文
posted @ 2019-08-10 22:32 #忘乎所以# 阅读(340) 评论(0) 推荐(0)
1117 Eddington Number (25 分)
摘要：1117 Eddington Number (25 分) 1117 Eddington Number (25 分) 1117 Eddington Number (25 分) British astronomer Eddington liked to ride a bike. It is said t 阅读全文
posted @ 2019-08-10 00:29 #忘乎所以# 阅读(274) 评论(0) 推荐(0)
1116 Come on! Let's C (20 分)
摘要：1116 Come on! Let's C (20 分) 1116 Come on! Let's C (20 分) 1116 Come on! Let's C (20 分) "Let's C" is a popular and fun programming contest hosted by th 阅读全文
posted @ 2019-08-10 00:15 #忘乎所以# 阅读(289) 评论(0) 推荐(0)
1135 Is It A Red-Black Tree (30 分)
摘要：1135 Is It A Red-Black Tree (30 分) 1135 Is It A Red-Black Tree (30 分) 1135 Is It A Red-Black Tree (30 分) There is a kind of balanced binary search tre 阅读全文
posted @ 2019-08-09 23:48 #忘乎所以# 阅读(489) 评论(0) 推荐(0)
1066 Root of AVL Tree (25 分)
摘要：1066 Root of AVL Tree (25 分) 1066 Root of AVL Tree (25 分) 1066 Root of AVL Tree (25 分) An AVL tree is a self-balancing binary search tree. In an AVL t 阅读全文
posted @ 2019-08-09 21:30 #忘乎所以# 阅读(242) 评论(0) 推荐(0)
1123 Is It a Complete AVL Tree (30 分)
摘要：1123 Is It a Complete AVL Tree (30 分) 1123 Is It a Complete AVL Tree (30 分) 1123 Is It a Complete AVL Tree (30 分) An AVL tree is a self-balancing bina 阅读全文
posted @ 2019-08-09 21:26 #忘乎所以# 阅读(204) 评论(0) 推荐(0)
1122 Hamiltonian Cycle (25 分)
摘要：1122 Hamiltonian Cycle (25 分) 1122 Hamiltonian Cycle (25 分) 1122 Hamiltonian Cycle (25 分) The "Hamilton cycle problem" is to find a simple cycle that 阅读全文
posted @ 2019-08-09 12:34 #忘乎所以# 阅读(403) 评论(0) 推荐(0)
1121 Damn Single (25 分)
摘要：1121 Damn Single (25 分) 1121 Damn Single (25 分) 1121 Damn Single (25 分) "Damn Single (单身狗)" is the Chinese nickname for someone who is being single. Y 阅读全文
posted @ 2019-08-09 12:05 #忘乎所以# 阅读(250) 评论(0) 推荐(0)
1120 Friend Numbers (20 分)
摘要：1120 Friend Numbers (20 分) 1120 Friend Numbers (20 分) 1120 Friend Numbers (20 分) Two integers are called "friend numbers" if they share the same sum o 阅读全文
posted @ 2019-08-09 11:48 #忘乎所以# 阅读(176) 评论(0) 推荐(0)
1127 ZigZagging on a Tree (30 分)
摘要：1127 ZigZagging on a Tree (30 分) 1127 ZigZagging on a Tree (30 分) 1127 ZigZagging on a Tree (30 分) Suppose that all the keys in a binary tree are dist 阅读全文
posted @ 2019-08-08 23:42 #忘乎所以# 阅读(496) 评论(0) 推荐(0)
1126 Eulerian Path (25 分)
摘要：1126 Eulerian Path (25 分) 1126 Eulerian Path (25 分) 1126 Eulerian Path (25 分) In graph theory, an Eulerian path is a path in a graph which visits ever 阅读全文
posted @ 2019-08-08 22:10 #忘乎所以# 阅读(154) 评论(0) 推荐(0)
1125 Chain the Ropes (25 分)
摘要：1125 Chain the Ropes (25 分) 1125 Chain the Ropes (25 分) 1125 Chain the Ropes (25 分) Given some segments of rope, you are supposed to chain them into o 阅读全文
posted @ 2019-08-08 12:13 #忘乎所以# 阅读(157) 评论(0) 推荐(0)
1124 Raffle for Weibo Followers (20 分)
摘要：1124 Raffle for Weibo Followers (20 分) 1124 Raffle for Weibo Followers (20 分) 1124 Raffle for Weibo Followers (20 分) John got a full mark on PAT. He w 阅读全文
posted @ 2019-08-08 11:59 #忘乎所以# 阅读(260) 评论(0) 推荐(0)
1131 Subway Map (30 分)
摘要：1131 Subway Map (30 分) 1131 Subway Map (30 分) 1131 Subway Map (30 分) In the big cities, the subway systems always look so complex to the visitors. To 阅读全文
posted @ 2019-08-07 21:50 #忘乎所以# 阅读(347) 评论(0) 推荐(0)
1130 Infix Expression (25 分)
摘要：1130 Infix Expression (25 分) 1130 Infix Expression (25 分) 1130 Infix Expression (25 分) Given a syntax tree (binary), you are supposed to output the co 阅读全文
posted @ 2019-08-06 23:39 #忘乎所以# 阅读(169) 评论(0) 推荐(0)
1129 Recommendation System (25 分)
摘要：1129 Recommendation System (25 分) 1129 Recommendation System (25 分) 1129 Recommendation System (25 分) Recommendation system predicts the preference th 阅读全文
posted @ 2019-08-06 22:36 #忘乎所以# 阅读(214) 评论(0) 推荐(0)
1128 N Queens Puzzle (20 分)
摘要：1128 N Queens Puzzle (20 分) 1128 N Queens Puzzle (20 分) 1128 N Queens Puzzle (20 分) The "eight queens puzzle" is the problem of placing eight chess qu 阅读全文
posted @ 2019-08-06 21:29 #忘乎所以# 阅读(223) 评论(0) 推荐(0)

1 2 3 4 下一页