leetcode: path-sum

题目描述:

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 andsum = 22,

  5
  / \
 4  8
 / / \
 11 13 4
 / \     \
7 27   1

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

解题思路：

1. 关于二叉树的问题，要条件发射的想到用递归的编码技巧去写

代码如下：

    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);
    }

转载于:https://my.oschina.net/happywe/blog/3089829