最大二叉树

/**
 * 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:
    // 递归
    int getMax(vector<int>& nums, int index_1, int index_2){
        if(index_1 >= index_2) return -1;
        int max = index_1;
        for(int i = index_1 + 1; i < index_2; i++){
            if(nums[i] > nums[max])
                max = i;
        }
        return max;
    }

    TreeNode* buildTree(vector<int>& nums, int index_1, int index_2){
        int max = getMax(nums, index_1, index_2);
        if(max == -1) return NULL;
        TreeNode* root = new TreeNode(nums[max]);
        root->left = buildTree(nums, index_1, max);
        root->right = buildTree(nums, max + 1, index_2);
        return root;
    }
    TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
        if(nums.size() == 0) return NULL;
        return buildTree(nums, 0, nums.size());
    }
};