代码随想录训练营第十六天打卡

UtsumiEr1c3

已于 2024-09-02 20:48:19 修改

阅读量143

点赞数 2

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

于 2024-09-02 20:48:07 首次发布

本文链接：https://blog.csdn.net/yhxzcsq/article/details/141829886

版权

代码随想录: 代码随想录

513. 找树左下角的值

层序遍历:

/**
 * 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:
    int findBottomLeftValue(TreeNode* root) {
        if (root == nullptr) return 0;
        queue<TreeNode*> q;
        q.push(root);
        int left = root->val;
        while (!q.empty()) {
            int size = q.size();
            left = q.front()->val;
            while (size--) {
                auto node = q.front();
                q.pop();
                if (node->left) q.push(node->left);
                if (node->right) q.push(node->right);
            }
        }
        return left;
    }
};

112. 路径总和

/**
 * 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:
    bool traversal(TreeNode* node, int targetSum) {
        if (node->left == nullptr && node->right == nullptr && targetSum == 0) return true;
        if (node->left == nullptr && node->right == nullptr && targetSum != 0) return false;
        if (node->left) {
            targetSum -= node->left->val;
            if(traversal(node->left, targetSum)) return true;
            targetSum += node->left->val;
        }
        if (node->right) {
            targetSum -= node->right->val;
            if (traversal(node->right, targetSum)) return true;
            targetSum += node->right->val;
        }
        return false;
    }

    bool hasPathSum(TreeNode* root, int targetSum) {
        if (root == nullptr) return false;
        return traversal(root, targetSum);
    }
};

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

/**
 * 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* traversal(vector<int>& inorder, vector<int>& postorder) {
        int value = postorder.back();
        TreeNode* root = new TreeNode(value);
        if (postorder.size() == 1) return root;
        int idx = 0;
        for ( ; idx < inorder.size(); idx++) {
            if (inorder[idx] == value) break;
        }
        vector<int> leftInorder = {inorder.begin(), inorder.begin() + idx};
        vector<int> rightInorder = {inorder.begin() + idx + 1, inorder.end()};

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

        vector<int> leftPostorder = {postorder.begin(), postorder.begin() + leftInorder.size()};
        vector<int> rightPosrorder = {postorder.begin() + leftInorder.size(), postorder.end()};

        root->left = buildTree(leftInorder, leftPostorder);
        root->right = buildTree(rightInorder, rightPosrorder);

        return root;
    }
    TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
        if (inorder.size() == 0) return nullptr;
        return traversal(inorder, postorder);
    }
};