- 博客(5)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 1038 Recover the Smallest Number (30 分)（贪心）
Given a collection of number segments, you are supposed to recover the smallest number from them. For example, given { 32, 321, 3214, 0229, 87 }, we can recover many numbers such like 32-321-3214-0229...
2019-09-30 18:07:51
227
原创 1021 Deepest Root (25 分) 测试点1是n=1 惊不惊喜
1021Deepest 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 root that results in a ...
2019-09-21 12:55:24
664
原创 1020 Tree Traversals (25 分)
1020Tree 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 output the level order ...
2019-09-18 19:17:19
383
原创 1018 Public Bike Management （深搜）
1018Public Bike Management(30分)There is a public bike service in Hangzhou City which provides great convenience to the tourists from all over the world. One may rent a bike at any station and ret...
2019-09-16 21:17:34
181
原创 1017. Queueing at Bank (25)-PAT甲级真题（感觉是比较简单的思路了）
1017Queueing at Bank(25分)Suppose a bank hasKwindows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. All the customers have to wai...
2019-09-13 18:54:27
449
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人