LeetCode 654. 最大二叉树 java题解

https://leetcode.cn/problems/maximum-binary-tree/description/

class Solution {
    public TreeNode constructMaximumBinaryTree(int[] nums) {
        return construct(nums,0,nums.length-1);
    }
    public TreeNode construct(int[] nums,int start,int end){
        if(start>end) return null;
        if(start==end) return new TreeNode(nums[start]);
        int max_index=start;
        for(int i=start+1;i<=end;i++){
            if(nums[i]>nums[max_index]){
                max_index=i;
            }
        }//寻找最大元素
        TreeNode root=new TreeNode(nums[max_index]);
        root.left=construct(nums,start,max_index-1);
        root.right=construct(nums,max_index+1,end);
        return root;
    }
}