# LeetCode 112 Path Sum (DFS)

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.

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

public boolean DFS(TreeNode root, int cur, int sum) {
if (root.left == null && root.right == null) {
cur += root.val;
return cur == sum;
}
cur += root.val;
if (root.left != null) {
if (DFS(root.left, cur, sum)) {
return true;
}
}
if (root.right != null) {
if (DFS(root.right, cur, sum)) {
return true;
}
}
return false;
}

public boolean hasPathSum(TreeNode root, int sum) {
if (root == null) {
return false;
}
return DFS(root, 0, sum);
}
}

• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120