2021年2月12日
PAT A1119 Pre- and Post-order Traversals (30 分)
摘要： Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and ino 阅读全文
posted @ 2021-02-12 23:57 coderJ_ONE 阅读(88) 评论(0) 推荐(0)
PAT A1057 Stack (30 分)
摘要： Stack is one of the most fundamental data structures, which is based on the principle of Last In First Out (LIFO). The basic operations include Push ( 阅读全文
posted @ 2021-02-12 23:40 coderJ_ONE 阅读(66) 评论(0) 推荐(0)
PAT A1101 Quick Sort (25 分)
摘要： There is a classical process named partition in the famous quick sort algorithm. In this process we typically choose one element as the pivot. Then th 阅读全文
posted @ 2021-02-12 17:24 coderJ_ONE 阅读(41) 评论(0) 推荐(0)
PAT A1016 Phone Bills (25 分)
摘要： A long-distance telephone company charges its customers by the following rules: Making a long-distance call costs a certain amount per minute, dependi 阅读全文
posted @ 2021-02-12 16:28 coderJ_ONE 阅读(50) 评论(0) 推荐(0)