LeetCode Path Sum

最新推荐文章于 2024-09-20 15:44:47 发布

lscHacker

最新推荐文章于 2024-09-20 15:44:47 发布

阅读量274

点赞数

分类专栏：算法/oj 文章标签： java leetcode DFS

本文链接：https://blog.csdn.net/miss_snow_m/article/details/46786657

版权

算法/oj 专栏收录该内容

253 篇文章 0 订阅

订阅专栏

Description:

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  13  4
         /  \      \
        7    2      1

return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

Solution:

还和前面一样DFS。

一直有一个需要注意的地方忘记说了：凡是类似这样，需要找到从root到leaf的path题目，dfs的终止条件应该是root.left==null && root.right==null，而不是前面root==null，二者本质都一样，只不过前者写起来麻烦了一点。

import java.util.*;

public class Solution {
	int targetSum;

	public boolean hasPathSum(TreeNode root, int sum) {
		if (root == null)
			return false;
		this.targetSum = sum;
		return dfs(root, 0);
	}

	boolean dfs(TreeNode root, int tempSum) {
		tempSum += root.val;
		if (root.left == null && root.right == null) {
			if (tempSum == targetSum)
				return true;
			return false;
		}
		boolean flag = false;
		if (root.left != null)
			flag = flag | dfs(root.left, tempSum);
		if (root.right != null)
			flag = flag | dfs(root.right, tempSum);
		return flag;
	}
}