LeetCode题解java算法: 112. 路径总和

给你二叉树的根节点 root 和一个表示目标和的整数 targetSum ，判断该树中是否存在 根节点到叶子节点 的路径，这条路径上所有节点值相加等于目标和 targetSum 。

叶子节点 是指没有子节点的节点。

示例 1：

输入：root = [5,4,8,11,null,13,4,7,2,null,null,null,1], targetSum = 22
输出：true

示例 2：

输入：root = [1,2,3], targetSum = 5
输出：false

示例 3：

输入：root = [1,2], targetSum = 0
输出：false

提示：

树中节点的数目在范围 [0, 5000] 内
-1000 <= Node.val <= 1000
-1000 <= targetSum <= 1000

广度优先遍历

class Solution {
    public boolean hasPathSum(TreeNode root, int sum) {
        if (root == null) {
            return false;
        }
        Queue<TreeNode> queNode = new LinkedList<TreeNode>();
        Queue<Integer> queVal = new LinkedList<Integer>();
        queNode.offer(root);
        queVal.offer(root.val);
        while (!queNode.isEmpty()) {
            TreeNode now = queNode.poll();
            int temp = queVal.poll();
            if (now.left == null && now.right == null) {
                if (temp == sum) {
                    return true;
                }
                continue;
            }
            if (now.left != null) {
                queNode.offer(now.left);
                queVal.offer(now.left.val + temp);
            }
            if (now.right != null) {
                queNode.offer(now.right);
                queVal.offer(now.right.val + temp);
            }
        }
        return false;
    }
}

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    class QueueNode{
        TreeNode node;
        int val;

        public QueueNode(TreeNode node,int val){
            this.node=node;
            this.val=val;
        }
    }
    public boolean hasPathSum(TreeNode root, int targetSum) {
        if(root==null){
            return false;
        }
        Queue<QueueNode> queue=new LinkedList<QueueNode>();
        queue.offer(new QueueNode(root,root.val));
        while(!queue.isEmpty()){
            QueueNode queueNode=queue.poll();
            TreeNode node=queueNode.node;
            int temp=queueNode.val;
            if(node.left==null&&node.right==null){
                if(targetSum==temp){
                    return true;
                }
                continue;
            }
            if(node.left!=null){
                queue.offer(new QueueNode(node.left,node.left.val+temp));
            }
             if(node.right!=null){
                queue.offer(new QueueNode(node.right,node.right.val+temp));
            }
        }
        return false;
    }
}

递归

class Solution {
    public boolean hasPathSum(TreeNode root, int targetSum) {
        if (root == null) {
            return false;
        }
        if (root.left == null && root.right == null) {
            return targetSum  == root.val;
        }
        return hasPathSum(root.left, targetSum  - root.val) || hasPathSum(root.right, targetSum  - root.val);
    }
}