. - 力扣（LeetCode）

class Solution {
public:TreeNode* constructMaximumBinaryTree(vector<int>& nums) {return construct(nums, 0, nums.size() - 1);}TreeNode* construct(const vector<int>& nums, int left, int right) {if (left > right) {return nullptr;}int best = left;for (int i = left + 1; i <= right; ++i) {if (nums[i] > nums[best]) {best = i;}}TreeNode* node = new TreeNode(nums[best]);node->left = construct(nums, left, best - 1);node->right = construct(nums, best + 1, right);return node;}
};