题目链接:https://leetcode-cn.com/problems/maximum-binary-tree/
题目如下:
/**
* 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) {
if(nums.size()==0) return nullptr;
return dfs(nums,0,nums.size()-1);
}
TreeNode* dfs(vector<int>& nums,int l,int r){
if(l>r) return nullptr;
//找出最大值及其所在的位置
int rootval=INT_MIN;
int rootpos=l;
for(int i=l;i<=r;i++){
if(nums[i]>rootval){
rootval=nums[i];
rootpos=i;
}
}
TreeNode* root=new TreeNode(rootval);
root->left=dfs(nums,l,rootpos-1);
root->right=dfs(nums,rootpos+1,r);
return root;
}
};