2019年6月
平衡二叉树（Self-balancing Binary Search Tree）
摘要： Date: 2019-04-11 18:49:18 AVL树的基本操作 判断一棵树是否为AVL树 阅读全文
posted @ 2019-06-03 21:30 林東雨 阅读(392) 评论(0) 推荐(0) 编辑
完全二叉树（Complete Binary Tree）
摘要： Date：2019-03-25 19:36:45 判断一棵树是否为完全二叉树 阅读全文
posted @ 2019-06-03 21:27 林東雨 阅读(455) 评论(0) 推荐(0) 编辑
PAT_A1123#Is It a Complete AVL Tree
摘要： Source: PAT A1123 Is It a Complete AVL Tree (30 分) Description: An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the 阅读全文
posted @ 2019-06-03 21:14 林東雨 阅读(221) 评论(0) 推荐(0) 编辑
PAT_A1125#Chain the Ropes
摘要： Source: PAT A1125 Chain the Ropes (25 分) Description: Given some segments of rope, you are supposed to chain them into one rope. Each time you may onl 阅读全文
posted @ 2019-06-01 23:10 林東雨 阅读(206) 评论(0) 推荐(0) 编辑
PAT_A1126#Eulerian Path
摘要： Source: PAT A1126 Eulerian Path (25 分) Description: In graph theory, an Eulerian path is a path in a graph which visits every edge exactly once. Simil 阅读全文
posted @ 2019-06-01 20:51 林東雨 阅读(138) 评论(0) 推荐(0) 编辑
2019年5月
PAT_A1127#ZigZagging on a Tree
摘要： Source: PAT A1127 ZigZagging on a Tree (30 分) Description: Suppose that all the keys in a binary tree are distinct positive integers. A unique binary 阅读全文
posted @ 2019-05-31 21:59 林東雨 阅读(670) 评论(0) 推荐(0) 编辑
PAT_A1129#Recommendation System
摘要： Source: PAT A1129 Recommendation System (25 分) Description: Recommendation system predicts the preference that a user would give to an item. Now you a 阅读全文
posted @ 2019-05-31 21:12 林東雨 阅读(132) 评论(0) 推荐(0) 编辑
PAT_A1113#Integer Set Partition
摘要： Source: PAT A1113 Integer Set Partition (25 分) Description: Given a set of N (>) positive integers, you are supposed to partition them into two disjoi 阅读全文
posted @ 2019-05-29 22:08 林東雨 阅读(196) 评论(0) 推荐(0) 编辑
PAT_A1120#Friend Numbers
摘要： Source: PAT A1120 Friend Numbers (20 分) Description: Two integers are called "friend numbers" if they share the same sum of their digits, and the sum 阅读全文
posted @ 2019-05-29 21:57 林東雨 阅读(161) 评论(0) 推荐(0) 编辑
PAT_A1134#Vertex Cover
摘要： Source: PAT A1134 Vertex Cover (25 分) Description: A vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at l 阅读全文
posted @ 2019-05-29 21:54 林東雨 阅读(136) 评论(0) 推荐(0) 编辑