树
LUCASYAN个
这个作者很懒,什么都没留下…
展开
-
515. Find Largest Value in Each Tree Row 找到数每一层的最大值
Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and k is the number of people in front of t原创 2017-09-05 00:07:20 · 217 阅读 · 0 评论 -
513. Find Bottom Left Tree Value 树 BFS
You are given an integer array sorted in ascending order (may contain duplicates), you need to split them into several subsequences, where each subsequences consist of at least 3 consecutive integers.原创 2017-09-05 00:06:53 · 190 阅读 · 0 评论 -
669. Trim a Binary Search Tree
Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly twoor zero sub-node. If the node has two sub-nodes, then this node's v原创 2017-09-24 20:05:09 · 295 阅读 · 0 评论