代码随想录训练营第二十天

最新推荐文章于 2024-07-12 21:04:18 发布

youngf186

最新推荐文章于 2024-07-12 21:04:18 发布

阅读量266

点赞数 1

文章标签： leetcode 算法数据结构

本文链接：https://blog.csdn.net/weixin_69144191/article/details/137514177

版权

最大二叉树

这题听懂了，算是比较简单的中等题

class Solution {
public:
    TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
        TreeNode* node = new TreeNode(0);
        if(nums.size() == 1) {
            node->val = nums[0];
            return node;
        }
            int maxValue = 0;
            int maxValueIndex = 0;
            for(int i = 0; i < nums.size(); i++) {
                if(nums[i] > maxValue) {
                    maxValue = nums[i];
                    maxValueIndex = i;
                }
            }
            //TreeNode* node = new TreeNode(0);
            node->val = maxValue;
            if (maxValueIndex > 0) {
                vector<int> newVec(nums.begin(), nums.begin() + maxValueIndex);
                node->left = constructMaximumBinaryTree(newVec);
            }
            if (maxValueIndex < nums.size() - 1) {
                vector<int> newVec(nums.begin() + maxValueIndex + 1, nums.end());
                node->right = constructMaximumBinaryTree(newVec);
            }
        return node;
    }
};

合并二叉树

这道题拿到手没有思路，看了视频后会了

class Solution {
public:
    TreeNode* mergeTrees(TreeNode* root1, TreeNode* root2) {
        if(root1 == nullptr) return root2;
        if(root2 == nullptr) return root1;
        root1->val += root2->val;
        root1->left = mergeTrees(root1->left, root2->left);
        root1->right = mergeTrees(root1->right, root2->right);
        return root1;
    }
};

二叉搜索树中的搜索

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

验证二叉搜索树

这道题不太会

中节点遍历不太懂

class Solution {
public:
    long long maxVal = LONG_MIN;
    bool isValidBST(TreeNode* root) {
        
        if(root == nullptr) return true;
        bool left = isValidBST(root->left);
        if(maxVal < root->val) maxVal = root->val;
        else return false;
        bool right = isValidBST(root->right);
        return left && right;
    }
};