leetcode-路径总和

题目

https://leetcode-cn.com/problems/path-sum/

思路

1. dfs

2. bfs + 两个队列

code

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @param {number} targetSum
 * @return {boolean}
 */
var hasPathSum = function(root, targetSum) {
    if (!root) return false;
    return dfs(root, targetSum, 0);

};

var dfs = function(root, targetSum, curSum){
    if (root.left==null && root.right == null){
        curSum += root.val;
        return curSum === targetSum? true:false;
    }
    let left, right;
    left = right = false;
    if (root.left){
        left = dfs(root.left, targetSum, curSum+root.val);
    }
    if (root.right){
        right = dfs(root.right, targetSum, curSum+root.val);
    }
    return left || right;
}