LeetCode 654. Maximum Binary Tree (Medium)

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.

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].

---

Analysis:
①Define a function public TreeNode constructMaximumNode(int[] nums, int l, int r)which is used to construct a root node of a tree that has the maximum from nums[l] to nums[r]. Then we recursively invoke this function to construct the left subtree and the right subtree.

②Define an auxiliary function public int findMaximumIndex(int[] nums, int l, int r)which is used to find the index of maximum from from nums[l] to nums[r]. In constructMaximumNode funtcion, we use findMaximumIndex function to get the index of the value of the root node. And then use the found index to determine the parameters of the next invoked function.

---

Code:

/**
 * 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) {
        return constructMaximumNode(nums, 0, nums.length);
    }
    
    public TreeNode constructMaximumNode(int[] nums, int l, int r) {
        if(l == r) {
            return null;
        }else{
            int maximumIndex = findMaximumIndex(nums, l, r);
            TreeNode root = new TreeNode(nums[maximumIndex]);
            root.left = constructMaximumNode(nums, l, maximumIndex);
            root.right = constructMaximumNode(nums, maximumIndex+1, r);
            return root;
        }
    }
    
    public int findMaximumIndex(int[] nums, int l, int r) {
        int maximumIndex = l;
        int maximum = nums[maximumIndex];
        for(int i = l+1; i < r; i++) {
            if(nums[i] > maximum) {
                maximumIndex = i;
                maximum = nums[maximumIndex];
            }
        }
        return maximumIndex;
    }
}