一遍过,但是好像用时很久
看了下都是这个思路
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode constructMaximumBinaryTree(int[] nums) {
if(nums.length==0) return null;
return build(nums,0,nums.length);
}
TreeNode build(int[] nums, int l, int r){
if(l>=r) return null;
int idx = l;
int max = nums[l];
for(int i=l; i<r; i++){
if(nums[i]>max){
max = nums[i];
idx = i;
}
}
//System.out.println(idx + " " + nums[idx]);
TreeNode root = new TreeNode(nums[idx]);
root.left = build(nums,l,idx);
root.right = build(nums,idx+1,r);
return root;
}
}