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

分析

根据所给数组建立二叉树，最大的作为根节点，左侧部分作为左子树，右侧部分作为右子树，递归实现，并传入左子树和右子树在数组中的检索范围。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
        int val=INT_MIN;
        int index=0;
        for(int i=0;i<nums.size();++i){//先找到最大值，作为根节点，并记录索引
            if(nums[i]>val){
                index=i;
                val=nums[i];
            }
        }
        TreeNode* root=new TreeNode(val);
        root->left=constructMBT(0,index,nums);//在左侧部分建立左子树
        root->right=constructMBT(index+1,nums.size(),nums);//在右侧部分建立右子树
        return root;
    }
    TreeNode* constructMBT(int beg,int end,vector<int>& nums){
        int val=INT_MIN;
        int index=0;
        if(beg==end)
            return NULL;
        for(int i=beg;i<end;++i){//在当前区间查找最大值作为根节点
            if(nums[i]>val){
                val=nums[i];
                index=i;
            }
        }
        TreeNode* root=new TreeNode(val);
        root->left=constructMBT(beg,index,nums);//递归建立左子树和右子树，其中范围指向为[beg,end)
        root->right=constructMBT(index+1,end,nums);
        return root;
    }
};