LeetCode.654 Maximum Binary Tree

题目：

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

1. The root is the maximum number in the array.
2. The left subtree is the maximum tree constructed from left part subarray divided by the maximum number.
3. 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:

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

分析：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode constructMaximumBinaryTree(int[] nums) {
        //给定二叉树，将其按规则构建成最大根树，其左子树为根左边的数组成，其右子树为根右边数组组成
        //思路：递归生成树，指定上下标，在指定位置查找最大值
        if(nums==null) return null;
        return backtrace(nums,0,nums.length-1);
    }
    //递归构建树
    public TreeNode backtrace(int [] nums,int start,int end){
        if(start>end) return null;
        //查找最大的数
        int maxIndex=start;
        for(int i=start+1;i<=end;i++){
            if(nums[i]>nums[maxIndex]){
                maxIndex=i;
            }
        }
        TreeNode root=new TreeNode(nums[maxIndex]);
        root.left=backtrace(nums,start,maxIndex-1);
        root.right=backtrace(nums,maxIndex+1,end);
        return root;

    }
}