Leetcode-路径总和

思路：递归思想，一开始想用回溯的，但后来想想，太麻烦了，就改成递归思想了。递归的终止条件是当到达叶子节点的时候。如果还没到达叶子节点时，那么看他是否有左右子节点，然后根据条件f1=hasPathSum(root.left,targetSum-root.val);
f2=hasPathSum(root.right,targetSum-root.val);

f1||f2;

/**
 * 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;
 *     }
 * }
 */