Leecode654 最大二叉树

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* construct(vector<int>&nums)
    {   
        if(nums.size() == 0) return nullptr;
        
        int max = INT_MIN;
        int maxindex;
        for(int i = 0 ;i < nums.size() ;i++)
        {
            if(nums[i] > max)
            {
                max = nums[i];
                maxindex = i;
            }
        }
        TreeNode* root = new TreeNode(max);
        if(nums.size() == 1) return root; // 叶子节点

        //分割 [0,maxindex)  [maxindex +1 ,end]
        if(maxindex > 0) //保证左区间至少有一个元素
        {
        vector<int>leftnums(nums.begin(),nums.begin()+maxindex);
        root->left = construct(leftnums);
        }
        if(maxindex < nums.size()-1)//保证右区间至少有一个元素
        {
        vector<int>rightnums(nums.begin()+maxindex+1,nums.end());
        root->right = construct(rightnums);
        }
        return root;
    }
    TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
        return construct(nums);
    }
};