lypbendlf - 博客园

2018年9月4日

摘要： For any 4-digit integer except the ones with all the digits being the same, if we sort the digits in non-increasing order first, and then in non-decre 阅读全文

posted @ 2018-09-04 14:45 lypbendlf 阅读(11193) 评论(0) 推荐(0) 编辑

PAT 1114 Family Property[并查集][难]

摘要： This time, you are supposed to help us collect the data for family-owned property. Given each person's family members, and the estate（房产）info under hi 阅读全文

posted @ 2018-09-04 12:13 lypbendlf 阅读(179) 评论(0) 推荐(0) 编辑

2018年9月3日

PAT 1147 Heaps[难]

摘要： 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 阅读全文

posted @ 2018-09-03 19:47 lypbendlf 阅读(159) 评论(0) 推荐(0) 编辑

PAT 1073 Scientific Notation[字符串处理][科学记数法]

摘要： Scientific notation is the way that scientists easily handle very large numbers or very small numbers. The notation matches the regular expression [+- 阅读全文

posted @ 2018-09-03 19:38 lypbendlf 阅读(175) 评论(0) 推荐(0) 编辑

PAT 1137 Final Grading[一般][排序]

摘要： For a student taking the online course "Data Structures" on China University MOOC (http://www.icourse163.org/), to be qualified for a certificate, he/ 阅读全文

posted @ 2018-09-03 16:56 lypbendlf 阅读(228) 评论(0) 推荐(0) 编辑

PAT 1056 Mice and Rice[难][不理解]

摘要： Mice and Rice is the name of a programming contest in which each programmer must write a piece of code to control the movements of a mouse in a given 阅读全文

posted @ 2018-09-03 14:58 lypbendlf 阅读(162) 评论(0) 推荐(0) 编辑

2018年9月1日

PAT 1110 Complete Binary Tree[判断完全二叉树]

摘要： Given a tree, you are supposed to tell if it is a complete binary tree. Input Specification: Each input file contains one test case. For each case, th 阅读全文

posted @ 2018-09-01 22:44 lypbendlf 阅读(228) 评论(0) 推荐(0) 编辑

PAT 1080 Graduate Admission[排序][难]

摘要： It is said that in 2011, there are about 100 graduate schools ready to proceed over 40,000 applications in Zhejiang Province. It would help a lot if y 阅读全文

posted @ 2018-09-01 10:35 lypbendlf 阅读(384) 评论(0) 推荐(0) 编辑

PAT 1061 Dating[简单]

摘要： Sherlock Holmes received a note with some strange strings: Let's date! 3485djDkxh4hhGE 2984akDfkkkkggEdsb s&hgsfdk d&Hyscvnm. It took him only a minut 阅读全文

posted @ 2018-09-01 10:19 lypbendlf 阅读(145) 评论(0) 推荐(0) 编辑

2018年8月31日

PAT 1143 Lowest Common Ancestor[难][BST性质]

摘要： The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants. A binary search tree (BST) i 阅读全文

posted @ 2018-08-31 22:01 lypbendlf 阅读(402) 评论(0) 推荐(0) 编辑

公告