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 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.

给你一个二叉树，和sum值，判断该树是否有一个从根到叶子的路径。使得该路径的和等于所给的sum。

分析：

递归，并深度优先搜素，搜素到叶子的时候，判断和是否等于sum。

错误答案：

	    public static boolean hasPathSum(TreeNode root, int sum) {
	    	int sumTemp=0;
	        return dfs(root,sum,sumTemp);
	    }
	    
	    public static boolean dfs(TreeNode node,int sum,int sumTemp){
	       	if(node==null) return false;//是否为空判断
	    	sumTemp +=node.val;
	    	if(node.left!=null) return dfs(node.left,sum,sumTemp);//必须得有return语句
	    	if(node.right!=null) return dfs(node.right,sum,sumTemp);
	    	
	    	if(sumTemp==sum) return true;
	    	else return false;
	    	
	    }

只会走左子树的通路,return 只能有一种情况。

正确答案:

	    public static boolean hasPathSum(TreeNode root, int sum) {
	    	int sumTemp=0;
	        return dfs(root,sum,sumTemp);
	    }
	    
	    public static boolean dfs(TreeNode node,int sum,int sumTemp){
	       	if(node==null) return false;//是否为空判断
	    	sumTemp +=node.val;
	    	if(node.left==null&&node.right==null) {
	    		if(sumTemp==sum) return true;
	    		else return false;
	    	}
	    	 return dfs(node.left,sum,sumTemp)||dfs(node.right,sum,sumTemp);
	    		    	
	    }