目录
题目:
代码(首刷看解析 2024年1月30日):
class Solution {
public:
TreeNode* recursion(vector<int>& nums, int left, int right) {
if (left >= right) return nullptr;
int maxIndex = left;
for (int i = left + 1; i < right; ++i) {
if (nums[i] > nums[maxIndex]) maxIndex = i;
}
TreeNode* root = new TreeNode(nums[maxIndex]);
root->left = recursion(nums, left, maxIndex);
root->right = recursion(nums, maxIndex + 1, right);
return root;
}
TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
return recursion(nums, 0, nums.size());
}
};
代码(二刷自解 2024年5月12日)
class Solution {
public:
// 前序遍历
TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
if (nums.empty()) return nullptr;
// 创建根节点,获得其下标
auto valToNode = helper(nums);
if (valToNode.second == -1) return nullptr;
TreeNode* node = new TreeNode(valToNode.first);
// 递归,左闭右开
vector<int> left = vector<int>(nums.begin(), nums.begin() + valToNode.second);
vector<int> right = vector<int>(nums.begin() + valToNode.second + 1, nums.end());
node->left = constructMaximumBinaryTree(left);
node->right = constructMaximumBinaryTree(right);
return node;
}
//返回最大值和对应下标
pair<int,int> helper(const vector<int>& nums) {
int val = INT_MIN;
int index = -1;
for (int i = 0; i < nums.size(); i++) {
if (nums[i] > val) {
val = nums[i];
index = i;
}
}
return {val,index};
}
};