原题链接: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* node = new TreeNode(0);
if(nums.size() == 1)
{
//只有一个结点
node ->val = nums[0];
return node;
}
int maxValue = 0;
int maxValueIndex = 0;
for(int i = 0; i < nums.size(); i++)
{
if(nums[i] > maxValue)
{
maxValue = nums[i];
maxValueIndex = i;
}
}
node ->val = maxValue;
//最大值在的下标左区间 构造左子树
if(maxValueIndex >0)
{
vector<int> newVec(nums.begin(),nums.begin() + maxValueIndex);
node ->left = constructMaximumBinaryTree(newVec);
}
//最大值所在的下标右区间 构造右子树
if(maxValueIndex < (nums.size() -1))
{
vector<int> newVec(nums.begin() + maxValueIndex + 1,nums.end());
node ->right = constructMaximumBinaryTree(newVec);
}
return node;
}
};