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

youngf186

已于 2024-04-07 22:10:08 修改

阅读量324

点赞数 3

文章标签： leetcode

于 2024-04-06 22:24:37 首次发布

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

版权

文章介绍了如何使用递归方法进行二叉树的中序与后序遍历，以及在二叉树中查找路径总和的问题，并提供了一段C++代码示例。

摘要由CSDN通过智能技术生成

找数左下角的值

class Solution {
    int maxDepth = INT_MIN;
    int result;
    void traversal(TreeNode* root, int depth){
        if(root->left == nullptr and root->right == nullptr) {
            if(depth > maxDepth) {
                maxDepth = depth;
                result = root->val;
            }
            return;
        }
        if(root->left) {
            depth++;
            traversal(root->left, depth);
            depth--;
        }
        if(root->right) {
            depth++;
            traversal(root->right, depth);
            depth--;
        }
        return;
    }
public:
    int findBottomLeftValue(TreeNode* root) {
        traversal(root, 0);
        return result;
    }
};

路径总和

这题还算好

class Solution {
public:
    bool traversal(TreeNode* root, int count) {
        if(root->left == nullptr and root->right == nullptr and count == 0) return true;
        if(root->left == nullptr and root->right == nullptr and count != 0) return false;
        if(root->left) {
            count -= root->left->val;
            if(traversal(root->left, count)) return true;
            count += root->left->val;
        }
        if(root->right) {
            count -= root->right->val;
            if(traversal(root->right, count)) return true;
            count += root->right->val;
        }
        return false;
    }
    bool hasPathSum(TreeNode* root, int targetSum) {
        if(root == nullptr) return false;
        return traversal(root, targetSum - root->val);
    }
};

从中序与后序遍历序列构造二叉树

太复杂

class Solution {
public:
    TreeNode* traversal(vector<int>& inorder, vector<int>& postorder) {
        if(postorder.size() == 0) return nullptr;
        int rootValue = postorder[postorder.size() - 1];
        TreeNode* root = new TreeNode(rootValue);

        if(postorder.size() == 1) return root;
        int index;
        for(index = 0; index < inorder.size(); index++) {
            if(inorder[index] == rootValue) break;
        }
        vector<int> leftInorder(inorder.begin(), inorder.begin() + index);
        vector<int> rightInorder(inorder.begin() + index + 1, inorder.end());

        postorder.resize(postorder.size() - 1);

        vector<int> leftPostorder(postorder.begin(), postorder.begin() + leftInorder.size());
        vector<int> rightPostorder(postorder.begin() + leftInorder.size(), postorder.end());
        
        root->left = traversal(leftInorder, leftPostorder);
        root->right = traversal(rightInorder,rightPostorder);
        return root;
    }
    TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
        if(inorder.size() == 0 or postorder.size() == 0) return nullptr;
        return traversal(inorder, postorder);
    }
};