摘要:
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 val... 阅读全文
posted @ 2017-09-10 17:40
xiejunzhao
阅读(636)
评论(0)
推荐(0)
摘要:
Given an unsorted array of integers, find the length of longest continuous increasing subsequence.Example 1:Input: [1,3,5,4,7] Output: 3 Explanation: The longest continuous increasing subsequence is [... 阅读全文
posted @ 2017-09-10 17:31
xiejunzhao
阅读(267)
评论(0)
推荐(0)
摘要:
Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R](R >= L). You might need to change the root of the tree, so the result... 阅读全文
posted @ 2017-09-10 17:31
xiejunzhao
阅读(1199)
评论(0)
推荐(0)

浙公网安备 33010602011771号