题目:
代码(首刷自解 2024年1月31日):
class Solution {
public:
TreeNode* recursion(vector<int>& nums, int left, int right) {
if (left > right) return nullptr;
int mid = left + (right-left)/2;
TreeNode* node = new TreeNode(nums[mid]);
node->left = recursion(nums,left,mid - 1);
node->right = recursion(nums,mid + 1,right);
return node;
}
TreeNode* sortedArrayToBST(vector<int>& nums) {
TreeNode* root = recursion(nums,0,nums.size()-1);
return root;
}
};
代码(二刷看解析 2024年3月6日)
完了,首刷能解的二刷做不出来了
/**
* 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* sortedArrayToBST(vector<int>& nums) {
if (nums.size() == 0) return nullptr;
return helper(nums, 0, nums.size() - 1);
}
TreeNode* helper(vector<int>& nums, int left, int right) {
if (left > right) {
return nullptr;
}
int mid = left + (right - left)/2;
TreeNode* newNode = new TreeNode(nums[mid]);
newNode->left = helper(nums, left, mid - 1);
newNode->right = helper(nums, mid + 1, right);
return newNode;
}
};
代码(三刷自解 2024年5月22日)
class Solution {
public:
// 左闭右开
TreeNode* helper(vector<int>& nums, int left, int right) {
if (left >= right) return nullptr;
int mid = left + (right - left) / 2;
TreeNode* node = new TreeNode(nums[mid]);
node->left = helper(nums, left, mid);
node->right = helper(nums, mid + 1, right);
return node;
}
TreeNode* sortedArrayToBST(vector<int>& nums) {
return helper(nums, 0, nums.size());
}
};