112. Path Sum | LeetCode

最新推荐文章于 2022-12-27 16:05:35 发布

雄性皮卡丘

最新推荐文章于 2022-12-27 16:05:35 发布

阅读量190

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/orz_713/article/details/52137878

版权

LeetCode 专栏收录该内容

39 篇文章 0 订阅

订阅专栏

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

For example:
Given the below binary tree and sum = 22,
[5,4,8,11,null,13,4,7,2,null,null,null,1]
return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

DFS递归

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

BFS

效率较低，仅作参考

public class Solution {
    public boolean hasPathSum(TreeNode root, int sum) {
        if(root == null) return false;
        Queue<Integer> valQueue = new LinkedList<Integer> ();
        Queue<TreeNode> nodeQueue = new LinkedList<TreeNode> ();
        valQueue.add(root.val);
        nodeQueue.add(root);

        while(!nodeQueue.isEmpty()) {
            int length = nodeQueue.size();
            for(int i = 0; i < length; i++) {
                TreeNode node = nodeQueue.poll();
                int temp = valQueue.poll();
                if(node.left == null && node.right == null) {
                    if(temp == sum) return true;
                }
                if(node.left != null) {
                    nodeQueue.add(node.left);
                    int n1 = temp + node.left.val;
                    valQueue.add(n1);
                }
                if(node.right != null) {
                    nodeQueue.add(node.right);
                    int n2 = temp + node.right.val;
                    valQueue.add(n2);
                }
            }
        }
        return false;
    }
}