Stone Game II
思路：
几乎和stone game一模一样。因为允许circle，所以在这里扩展一次数组。比如[4,4,5,9]，就变成了[4,4,5,9,4,4,5,9]。区间还是1~n。
实现：
所求得的最终结果是每个区间的最小值。
几乎和stone game一模一样。因为允许circle，所以在这里扩展一次数组。比如[4,4,5,9]，就变成了[4,4,5,9,4,4,5,9]。区间还是1~n。
实现：
所求得的最终结果是每个区间的最小值。
776. Split BST
Problem: Given a Binary Search Tree (BST) with root node root , and a target value V , split the tree into two subtrees where one subtree has nodes that are all smaller or equal to the target value, while the other subtree has all nodes that are greater than the target value. It's not necessarily the case that the tree contains a node with value V . Additionally, most of the structure of the original tree should remain. Formally, for any child C with parent P in the original tree, if they are both in the same subtree after the split, then node C should still have the parent P. You should output the root TreeNode of both subtrees after splitting, in any order. Example 1: Input: root = [4,2,6,1,3,5,7], V = 2 Output: [[2,1],[4,3,6,null,null,5,7]] Explanation: Note that root, output[0], and output[1] are TreeNode objects, not arrays. The given tree [4,2,6,1,3,5,7] is represented by the following diagram: 4 / \ 2 6 / \ / \ 1
评论
发表评论