题目:654. 最大二叉树
思路:递归
/**
* 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* constructMaximumBinaryTree(vector<int>& nums) {
TreeNode* res = dfs(nums,0,nums.size());
return res;
}
TreeNode* dfs(vector<int>& nums,int l,int r){
if(l >= r){
return nullptr;
}
int bond = 0;
int maxm = -1;
for(int i = l;i < r;++i){
if(nums[i] > maxm){
bond = i;
maxm = nums[i];
}
}
TreeNode* left = dfs(nums,l,bond);
TreeNode* right = dfs(nums,bond+1,r);
return new TreeNode(nums[bond],left,right);
}
};