前言
题目: 654. 最大二叉树
文档: 代码随想录——最大二叉树
编程语言: C++
解题状态: 成功解答!
思路
构建二叉树的话,首先我们可以想到递归。本题中,我们找到数组中的最大值,再分别对两侧的数组进行同样的操作就好。
代码
/**
* 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 {
private:
TreeNode* traversal(vector<int>& nums) {
if (nums.size() == 0) return NULL;
int max = INT_MIN;
int breakPoint;
for (int i = 0; i < nums.size(); i++) {
if (nums[i] > max) {
max = nums[i];
breakPoint = i;
}
}
int rootValue = nums[breakPoint];
TreeNode* root = new TreeNode(rootValue);
if (nums.size() == 1) return root;
vector<int> leftNums(nums.begin(), nums.begin() + breakPoint);
vector<int> rightNums(nums.begin() + breakPoint + 1, nums.end());
root -> left = traversal(leftNums);
root -> right = traversal(rightNums);
return root;
}
public:
TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
if (nums.size() == 0) return NULL;
return traversal(nums);
}
};