LeetCode 654 Maximum Binary Tree(递归)

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:

1. The size of the given array will be in the range [1,1000].

题目链接：https://leetcode.com/problems/maximum-binary-tree/description/

题目分析：基础的递归构造，击败97%

/** * Definition for a binary tree node. * public class TreeNode { *     int val; *     TreeNode left; *     TreeNode right; *     TreeNode(int x) { val = x; } * } */class Solution {        public TreeNode constructHelper(int[] nums, int l, int r) {        if (l > r) {            return null;        }        if (l == r) {            return new TreeNode(nums[l]);        }        int ma_idx = l;        for (int i = l + 1; i <= r; i ++) {            if (nums[i] > nums[ma_idx]) {                ma_idx = i;            }          }        TreeNode root = new TreeNode(nums[ma_idx]);        root.left = constructHelper(nums, l, ma_idx - 1);        root.right = constructHelper(nums, ma_idx + 1, r);        return root;    }        public TreeNode constructMaximumBinaryTree(int[] nums) {        return constructHelper(nums, 0, nums.length - 1);    }}