2020年5月14日
PAT 1013 Battle Over Cities (25分) 图的连通分量+DFS
摘要： 题目 It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward tha 阅读全文
posted @ 2020-05-14 19:19 无代码，非程序 阅读(100) 评论(0) 推荐(0)
PAT 1021 Deepest Root (25分) 从测试点3超时到满分再到代码优化
摘要： 题目 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 阅读全文
posted @ 2020-05-14 18:48 无代码，非程序 阅读(521) 评论(0) 推荐(0)
PAT 1020 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 阅读全文
posted @ 2020-05-14 13:30 无代码，非程序 阅读(173) 评论(0) 推荐(0)