6.5二叉树(654.最大二叉树）

class Solution {
public:
    TreeNode* constructMaximumBinaryTree(vector& nums) {
        return build(nums, 0, nums.size());
    }

    TreeNode* build(vector& nums, int left, int right){
        if(left>=right) return nullptr;
        int max_index = left;

        for(int i = left; i 
            if(nums[i] > nums[max_index]){
                max_index = i;
            }
        }

        TreeNode* node = new TreeNode(nums[max_index]);
        
        node->left = build(nums, left, max_index);

        node->right = build(nums, max_index+1, right);

        return node;
    }
};

今天除了这道题，还把昨天的题目优化了一下，感觉还是不错的哦。