leetcode 654. Maximum Binary Tree（最大二叉树）

Given an integer array with no duplicates. A maximum tree building on this array is defined as follow:

The root is the maximum number in the array.
The left subtree is the maximum tree constructed from left part subarray divided by the maximum number.
The right subtree is the maximum tree constructed from right part subarray divided by the maximum number.
Construct the maximum tree by the given array and output the root node of this tree.

Example 1:
Input: [3,2,1,6,0,5]
Output: return the tree root node representing the following tree:

      6
    /   \
   3     5
    \    / 
     2  0   
       \
        1

Note:
The size of the given array will be in the range [1,1000].

给出一个数组，选出最大值作为root，最大值左边的数组部分作为左子树，右边的数组部分作为右子树，左子树和右子树的规则也是一样。

思路：
先把root构建出来，然后递归构建左子树和右子树，因为需要的是数组的一部分，因此需要起始和终止的index信息。

    public TreeNode constructMaximumBinaryTree(int[] nums) {
        int n = nums.length;
        return helper(nums, 0, n-1);
    }
    
    TreeNode helper(int[] nums, int start, int end) {
        if(start > end) return null;
        int maxV = nums[start];
        int index = start;
        for(int i = start+1; i <= end; i++) {
            if(nums[i] > maxV) {
                maxV = nums[i];
                index = i;
            }
        }
        TreeNode root = new TreeNode(maxV);
        root.left = helper(nums, start, index-1);
        root.right = helper(nums, index+1, end);
        return root;
    }