LeetCode-Maximum Binary Tree

一、Description

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.

题目大意：

给一个整数数组，最大数的创建是按照如下规则定义的：

根节点是数组中最大的数max，它的左结点是max左边数组元素中最大的数，右结点是max右边数组元素中最大的数，以此内推。

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

---

二、Analyzation

一般像这种构造树的思路都是采用递归来操作，不断地调用同一个函数达到想要的效果：每次找到数组中从start到end中最大的那个数，并构造出一个新的结点，再更新start和end的值，递归的结束条件是start > end退出递归。

---

三、Accepted code

class Solution {
    public TreeNode constructMaximumBinaryTree(int[] nums) {
        if (nums == null || nums.length == 0) {
            return null;
        }
        return help(nums, 0, nums.length - 1);
    }
    public TreeNode help(int[] nums, int start, int end) {
        if (start > end) {
            return null;
        }
        int max = nums[start], maxi = start;
        for (int i = start + 1; i <= end; i++) {
            if (max < nums[i]) {
                max = nums[i];
                maxi = i;
            }
        }
        TreeNode root = new TreeNode(max);
        root.left = help(nums, start, maxi - 1);
        root.right = help(nums, maxi + 1, end);
        return root;
    }
}