day 16 (代码随想录补卡） 513 找树左下角的值 | 112 路径总和

513 找树左下角的值

题目链接：https://leetcode.cn/problems/find-bottom-left-tree-value/description/

/**
 * 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) {
        queue<TreeNode*> que;
        if (root != nullptr)
        que.push(root);
        int result = 0;
        while (!que.empty()){
         int size = que.size();
         for (int i=0; i< size; i++){
            TreeNode* node = que.front();
            que.pop();
            if (i==0)
            result = node->val;  // 目的是记录最后一行第一个元素
            if(node->left)
            que.push(node->left);
            if(node->right)
            que.push(node->right);
         }   
        }
        return result;
    }
};

112 路径总和

题目链接：https://leetcode.cn/problems/path-sum/ 

/**
 * 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 {
private:
    bool traversal(TreeNode* cur, int count){
        if(!cur->left && !cur->right && count == 0) // 遇到叶子节点，且计数为0
        return true;
        if(!cur->left && !cur->right)
        return false;

        if(cur->left){
            count -= cur->left->val; //递归，处理节点；
            if(traversal(cur->left,count))
            return true;
            count += cur->left->val; //回溯，撤销处理结果
        }
        return false;
    } 
public:
    bool hasPathSum(TreeNode* root, int targetSum) {
        if (root == nullptr) return false;
        return traversal(root, targetSum - root->val);
    }
};