leetcode654

class Solution
{
public:
    TreeNode* constructMaximumBinaryTree(vector<int>& nums)
    {
        if (nums.size() == )
            return NULL;
        else if (nums.size() == )
        {
            TreeNode * node = new TreeNode(nums[]);
            return node;
        }
        else
        {
            int max = ;
            for (int i = ; i<nums.size(); i++)
            {
                if (nums[i]>nums[max])
                    max = i;
            }
            vector<int> left_num, right_num;
            for (int i = ; i<max; i++)
            {
                left_num.push_back(nums[i]);
            }
            for (int j = max + ; j<nums.size(); j++)
            {
                right_num.push_back(nums[j]);
            }
            TreeNode * node = new TreeNode(nums[max]);
            node->left = constructMaximumBinaryTree(left_num);
            node->right = constructMaximumBinaryTree(right_num);
            return node;
        }
    }
};