![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Pat
summer--bling
眼前的黑不是黑。
展开
-
1146 Topological Order (25 分)
1146 Topological Order (25 分) This is a problem given in the Graduate Entrance Exam in 2018: Which of the following is NOT a topological order obtained from the given directed graph? Now you are supp...翻译 2019-01-17 14:19:48 · 105 阅读 · 0 评论 -
1145 Hashing - Average Search Time (25 分)
1145 Hashing - Average Search Time (25 分) The task of this problem is simple: insert a sequence of distinct positive integers into a hash table first. Then try to find another sequence of integer key...原创 2019-01-17 09:04:27 · 176 阅读 · 0 评论 -
1144 The Missing Number (20 分)
1144 The Missing Number (20 分) Given N integers, you are supposed to find the smallest positive integer that is NOT in the given list. Input Specification: Each input file contains one test case. F...原创 2019-01-16 20:49:27 · 256 阅读 · 0 评论 -
1139 First Contact (30 分)
1139 First Contact (30 分) Unlike in nowadays, the way that boys and girls expressing their feelings of love was quite subtle in the early years. When a boy A had a crush on a girl B, he would usually...翻译 2019-01-22 15:54:36 · 232 阅读 · 0 评论 -
1138 Postorder Traversal (25 分)(根据先序和中序序列,后序遍历二叉树)
1138 Postorder Traversal (25 分) Suppose that all the keys in a binary tree are distinct positive integers. Given the preorder and inorder traversal sequences, you are supposed to output the first num...翻译 2019-01-22 09:45:51 · 161 阅读 · 1 评论 -
1137 Final Grading (25 分)
1137 Final Grading (25 分) For a student taking the online course "Data Structures" on China University MOOC (http://www.icourse163.org/), to be qualified for a certificate, he/she must first obtain n...原创 2019-01-20 19:34:25 · 173 阅读 · 0 评论 -
1136 A Delayed Palindrome (20 分)
1136 A Delayed Palindrome (20 分) Consider a positive integer N written in standard notation with k+1 digits ai as ak⋯a1a0 with 0≤ai<10 for all i and ak>0. Then N is palindromi...翻译 2019-01-20 11:08:22 · 87 阅读 · 0 评论 -
1142 Maximal Clique (25 分)
1142 Maximal Clique (25 分) A clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. A maximal clique is a clique that cannot be extend...翻译 2019-01-19 15:35:56 · 183 阅读 · 0 评论 -
1140 Look-and-say Sequence (20 分)
1140 Look-and-say Sequence (20 分) Look-and-say sequence is a sequence of integers as the following: D, D1, D111, D113, D11231, D112213111, ... where D is in [0, 9] except 1. The (n+1)st number is...翻译 2019-01-18 09:34:20 · 240 阅读 · 0 评论 -
1148 Werewolf - Simple Version (20 分)狼人杀
1148 Werewolf - Simple Version (20 分) Werewolf(狼人杀) is a game in which the players are partitioned into two parties: the werewolves and the human beings. Suppose that in a game, player #1 said: "Pla...翻译 2019-01-17 21:22:46 · 532 阅读 · 0 评论 -
1147 Heaps (30 分)
1147 Heaps (30 分) In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either greater ...原创 2019-01-17 16:34:28 · 72 阅读 · 0 评论 -
1132 Cut Integer (20 分)
1132 Cut Integer (20 分) Cutting an integer means to cut a K digits lone integer Z into two integers of (K/2) digits long integers A and B. For example, after cutting Z = 167334, we have A = 167 and B...原创 2019-01-22 19:20:43 · 277 阅读 · 0 评论