Method max

java/654_Maximum_Binary_Tree.java:14–21

(int[] nums, int l, int r)

        return root;
    }
    public int max(int[] nums, int l, int r) {
        int max_i = l;
        for (int i = l; i < r; i++) {
            if (nums[max_i] < nums[i])
                max_i = i;
        }
        return max_i;
    }
    /*public TreeNode constructMaximumBinaryTree(int[] nums) {
        // https://leetcode.com/problems/maximum-binary-tree/discuss/106146/C++-O(N)-solution
        Stack<TreeNode> stack = new Stack<>();