#654最大二叉树

import java.util.*;

class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;

    TreeNode(int val) {
        this.val = val;
    }
}

class Solution {
    public TreeNode constructMaximumBinaryTree(int[] nums) {
        return build(nums, 0, nums.length);
    }

    private TreeNode build(int[] nums, int left, int right) {
        if (left >= right) return null;
        int maximum = left;
        for (int i = left + 1; i < right; i++) {
            if (nums[i] > nums[maximum]) maximum = i;
        }
        TreeNode root = new TreeNode(nums[maximum]);
        root.left = build(nums, left, maximum);
        root.right = build(nums, maximum + 1, right);
        return root;
    }
}