LeetCode——Maximum Binary Tree（654）

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) {}
 * };
 */
static const auto __ = [](){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    return nullptr;
}();
class Solution {
public:
    TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
        return makeTree(nums, 0, nums.size()-1);
    }
    
    TreeNode* makeTree(vector<int>& nums, int left, int right){
        if(left>right)
            return NULL;
        int max = left;
        for(int i=left+1;i<=right;++i)
            if(nums[max]<nums[i])
                max = i;
        TreeNode* root = new TreeNode(nums[max]);
        root->left = makeTree(nums, left, max-1);
        root->right = makeTree(nums, max+1, right);
        return root;
                
    }
    
};

 

第二种方法

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
static const auto __ = [](){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    return nullptr;
}();
class Solution {
public:
    TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
        vector<TreeNode*> stk;
        for(auto& num:nums)
        {
            TreeNode* temp = new TreeNode(num);
            while(!stk.empty()&&stk.back()->val < num)
            {
                temp->left = stk.back();
                stk.pop_back();
            }
            if(!stk.empty())
                stk.back()->right = temp;
            stk.push_back(temp);
        }
        return stk.front();
    }
};