112. Path Sum

最新推荐文章于 2024-06-15 09:23:13 发布

北城路人

最新推荐文章于 2024-06-15 09:23:13 发布

阅读量68

点赞数

分类专栏：算法打卡文章标签： leetcode 算法数据结构

本文链接：https://blog.csdn.net/weixin_42542290/article/details/127833033

版权

算法打卡专栏收录该内容

55 篇文章 0 订阅

订阅专栏

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

方法一迭代

1 方法思想

2 代码实现

/**
 * 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 {
    
        public boolean hasPathSum(TreeNode root, int targetSum) {
        if (root == null) return false;
        Queue<TreeNode> queue = new LinkedList<>();
        Queue<Integer> sumQueue = new LinkedList<>();
        queue.add(root);
        sumQueue.add(root.val);
        while (!queue.isEmpty()) {

            int size = queue.size();
            while (size-- > 0) {
                TreeNode node = queue.poll();
                Integer integer = sumQueue.poll();
                if (node.left == null && node.right == null && integer == targetSum) {
                    return true;
                }
                if (node.left != null) {
                    queue.add(node.left);
                    sumQueue.add(integer + node.left.val);
                }
                if (node.right != null) {
                    queue.add(node.right);
                    sumQueue.add(integer + node.right.val);
                }
            }

        }
        return false;


    }
   
}

3 复杂度分析

时间复杂度：
空间复杂度：

4 涉及到知识点

5 总结

方法二递归

1 方法思想

2 代码实现

/**
 * 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 {
    
       public boolean hasPathSum(TreeNode root, int targetSum) {
        if(root == null) return false;
        if(root.right == null && root.left == null){
            return targetSum == root.val;
        }
        return hasPathSum(root.right, targetSum - root.val) || hasPathSum(root.left, targetSum - root.val);
    }
}