根据数组构建最大二叉树

根据数组构建最大二叉树

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

    private TreeNode maxTree(int[] nums, int l, int r) {
        if (l > r) {
            return null;
        }
        // 找到最大值所在的索引
        int index = findMax(nums, l, r);
        TreeNode root = new TreeNode(nums[index]);
        root.left = maxTree(nums, l, index - 1);
        root.right = maxTree(nums, index + 1, r);
        return root;
    }

    private int findMax(int[] nums, int l, int r) {
        int maxIndex = l;
        int maxValue = Integer.MIN_VALUE;
        for (int i = l; i <= r; i++) {
            if (nums[i] > maxValue) {
                maxValue = nums[i];
                maxIndex = i;
            }
        }
        return maxIndex;
    }
}

/**
 * 二叉树类的定义
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */