654-Maximum Binary Tree

Description

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

---

问题描述

给定一个没有重复元素的数组。由此数组创建的最大树定义如下:

1. 根节点为数组中的最大的数
2. 左子树为根据数组的最大的数的左半部分创建的最大树
3. 右子树为根据数组的最大的数的右半部分创建的最大树

---

问题分析

递归的话， 注意起始位置和结束位置， 找到最大的数创建当前根节点即可

---

解法1

class Solution {
    public TreeNode constructMaximumBinaryTree(int[] nums) {
        Deque<TreeNode> stack = new LinkedList();

        for(int i = 0; i < nums.length; i++) {
            TreeNode curr = new TreeNode(nums[i]);
            while(!stack.isEmpty() && stack.peek().val < nums[i]) {
                curr.left = stack.pop();
            }
            if(!stack.isEmpty()) {
                stack.peek().right = curr;
            }
            stack.push(curr);
        }

        return stack.isEmpty() ? null : stack.removeLast();
    }
}

---

解法2

class Solution {
    public TreeNode constructMaximumBinaryTree(int[] nums) {
        if(nums == null) return null;

        return constructTree(nums, 0, nums.length);
    }
    public TreeNode constructTree(int[] nums,int start,int end){
        if(start == end) return null;

        int index = findMax(nums, start, end);
        TreeNode root = new TreeNode(nums[index]);

        root.left = constructTree(nums, start, index);
        root.right = constructTree(nums, index + 1, end);

        return root;
    }
    public int findMax(int[] nums, int start, int end){
        int index = start;

        for(int i = start;i < end;i ++){
            if(nums[i] > nums[index]){
                index = i;
            }
        }

        return index;
    }