| | | |

2019年2月17日

PAT A1021 Deepest Root （25 分）——图的BFS,DFS

摘要： A graph which is connected and acyclic can be considered a tree. The hight of the tree depends on the selected root. Now you are supposed to find the 阅读全文

posted @ 2019-02-17 21:21 tccbj 阅读(422) 评论(0) 推荐(0)

PAT A1020 Tree 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 ou 阅读全文

posted @ 2019-02-17 21:02 tccbj 阅读(136) 评论(0) 推荐(0)

PAT A1019 General Palindromic Number （20 分）——回文，进制转换

摘要： A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number 阅读全文

posted @ 2019-02-17 15:38 tccbj 阅读(312) 评论(0) 推荐(0)

PAT A1018 Public Bike Management （30 分）——最小路径，溯源，二标尺，DFS

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

posted @ 2019-02-17 15:06 tccbj 阅读(212) 评论(0) 推荐(0)