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

这道题思路很简单。

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

public TreeNode construt(int[] nums,int left,int right){
	if(left>right){
		return null;
	}
	int max=nums[left];
	int max_index=left;
	for(int i=left+1;i<=right;i++){
		if(nums[i]>max){
			max=nums[i];
			max_index=i;
		}
	}
	TreeNode root=new TreeNode(max);
	root.left=construt(nums, left, max_index-1);
	root.right=construt(nums, max_index+1, right);
	return root;
}

这道题有solutions： https://leetcode.com/problems/maximum-binary-tree/solution/

但是好像没编辑完全，只有一个解法，而且还和我的一样。。。。。。

Solution

---

Approach #1 Recursive Solution[Accepted]

Java

public class Solution {
    public TreeNode constructMaximumBinaryTree(int[] nums) {
        return construct(nums, 0, nums.length);
    }
    public TreeNode construct(int[] nums, int l, int r) {
        if (l == r)
            return null;
        int max_i = max(nums, l, r);
        TreeNode root = new TreeNode(nums[max_i]);
        root.left = construct(nums, l, max_i);
        root.right = construct(nums, max_i + 1, 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;
    }
}

Complexity Analysis

• Time complexity : O(n^2)O(n​2​​). The function construct is called $n$ times. At each level of the recursive tree, we traverse over all the $n$ elements to find the maximum element. In the average case, there will be a $log(n)$ levels leading to a complexity of $O(nlog(n))$. In the worst case, the depth of the recursive tree can grow upto $n$, which happens in the case of a sorted $nums$ array, giving a complexity of O(n^2)O(n​2​​).

• Space complexity : $O(n)$. The size of the $set$ can grow upto $n$ in the worst case. In the average case, the size will be $log(n)$ for $n$ elements in $nums$, giving an average case complexity of $O(log(n))$