还以为手写avl,以前pat的时候手写avl轻轻松松,现在估计有点难
其实就是二分递归建树,找到mid,用mid左边的序列来建左子树,mid右边来建右子树,mid用来创建当前结点。l>r才返回,=不返回。
/**
* 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* helper(vector<int>& nums,int l, int r){
if(l > r) return nullptr;
int mid = l + (r-l)/2;
TreeNode* root = new TreeNode(nums[mid]);
root->left = helper(nums,l,mid-1);
root->right = helper(nums,mid+1,r);
return root;
}
TreeNode* sortedArrayToBST(vector<int>& nums) {
//要高度平衡的BST,那不就是avl树?
//用一个二分来选定每次的根结点
if(nums.size() == 0) return nullptr;
return helper(nums,0,nums.size()-1);
}
};
因为要高度平衡,而且直接是有序的,所以我们用二分递归建树,递归边界就是l>r
class Solution {
public:
TreeNode* helper(vector<int>& nums, int l, int r){
if(l > r) return nullptr;
int mid = l + (r-l)/2;
TreeNode* root = new TreeNode(nums[mid]);
root->left = helper(nums,l,mid-1);
root->right = helper(nums,mid+1,r);
return root;
}
TreeNode* sortedArrayToBST(vector<int>& nums) {
//bst的特点:中序是从小到大的,所以我们相当于已经有它的中序了
//又因为要高度平衡,所以我们用二分,每次取中间作为根结点,然后递归搭建左右子树
TreeNode* root = helper(nums,0,nums.size()-1);
return root;
}
};