day23打卡

最新推荐文章于 2024-06-20 21:23:57 发布

沉着冷静2024

最新推荐文章于 2024-06-20 21:23:57 发布

阅读量178

点赞数 2

分类专栏：代码文章标签：算法 leetcode

本文链接：https://blog.csdn.net/dev1cce/article/details/135981875

版权

代码专栏收录该内容

41 篇文章 0 订阅

订阅专栏

day23打卡

669. 修剪二叉搜索树

递归法
时间复杂度：O(N)，空间复杂度：O(N)

class Solution {
public:
    TreeNode* trimBST(TreeNode* root, int low, int high) {
        if(root == nullptr) return nullptr;
        if(root->val < low) return trimBST(root->right, low, high);
        if(root->val > high) return trimBST(root->left, low, high);
        root->left = trimBST(root->left, low, high);
        root->right = trimBST(root->right, low, high);
        return root;
    }
};

迭代法
时间复杂度：O(N)，空间复杂度：O(1)

class Solution {
public:
    TreeNode* trimBST(TreeNode* root, int low, int high) {
        //让头结点，处于[low, high]范围内
        while(root != nullptr && (root->val < low || root->val > high))
        {
            if(root->val < low) root = root->right;
            if(root->val > high) root = root->left;
        }
        //处理左子树
        TreeNode* tmp = root;
        while(tmp != nullptr)
        {
            while(tmp->left != nullptr && tmp->left->val < low)
            {
                tmp->left = tmp->left->right;
            }
            tmp = tmp->left;
        }
        //处理右子树
        tmp = root;
        while(tmp != nullptr)
        {
            while(tmp->right != nullptr && tmp->right->val > high)
            {
                tmp->right = tmp->right->left;
            }
            tmp = tmp->right;
        }
        return root;
    }
};

108. 将有序数组转换为二叉搜索树

递归法
时间复杂度：O(N)，空间复杂度：O(N)

class Solution {
public:
    TreeNode* dfs(vector<int>& nums, int left, int right)
    {
        if(left > right) return nullptr;
        int mid = (right - left) / 2 + left;
        TreeNode* root = new TreeNode(nums[mid]);
        root->left = dfs(nums, left, mid-1);
        root->right = dfs(nums, mid+1, right);
        return root;
    }
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        TreeNode* root =  dfs(nums, 0, nums.size()-1);
        return root;
    }
};

538. 把二叉搜索树转换为累加树

递归法
时间复杂度：O(N)，空间复杂度：O(logN)

class Solution {
public:
    int sum = 0;
    void dfs(TreeNode* root)
    {  
        if(root == nullptr) return;
        //右-中-左
        dfs(root->right);
        root->val += sum;
        sum = root->val;
        dfs(root->left);
    }
    TreeNode* convertBST(TreeNode* root) {
        dfs(root);
        return root;
    }
};

迭代法
时间复杂度：O(N)，空间复杂度：O(1)

class Solution {
public:
    TreeNode* convertBST(TreeNode* root) {
        stack<TreeNode*> st;
        int sum = 0;
        TreeNode* cur = root;
        while(!st.empty() || cur != nullptr)
        {
            if(cur != nullptr)
            {
                st.push(cur);
                cur = cur->right;
            }
            else
            {
                cur = st.top();
                st.pop();
                cur->val += sum;
                sum = cur->val;
                cur = cur->left;
            }
        }
        return root;
    }
};