Leetcode之PathSum问题

1. Path Sum
   leetcode - 112. Path Sum

class Solution {
    public boolean hasPathSum(TreeNode root, int sum) {
        if(root==null){
            return false;
        }
        
        if(root.left==null && root.right==null){
            return sum==root.val;
        }
        boolean left = hasPathSum(root.left,sum-root.val);
        boolean right = hasPathSum(root.right,sum-root.val);
        return left||right;
    }
}

2. Path Sum II
   leetcode - 113. Path Sum II
   

public class Solution {
    ArrayList<ArrayList<Integer>> res = new ArrayList<>();
    ArrayList<Integer> list = new ArrayList<>();
    public ArrayList<ArrayList<Integer>> FindPath(TreeNode root,int target) {
        if(root==null){
            return res;
        }
        find(root,target);
        return res;
    }
    public void find(TreeNode root, int target){
        list.add(root.val);
        if(root.val==target && root.left==null && root.right==null){
            res.add(new ArrayList<>(list));
        }
        if(root.left!=null){
            find(root.left,target-root.val);
        }
        if(root.right!=null){
            find(root.right,target-root.val);
        }
        list.remove(list.size()-1);
    }
}

3. Path Sum III
   leetcode - 437. Path Sum III

class Solution {
    public int pathSum(TreeNode root, int sum) {
        if(root==null){
            return 0;
        }
        return find(root,sum)+pathSum(root.left,sum)+pathSum(root.right,sum);
    }
    public int find(TreeNode root, int sum){
        if(root==null){
            return 0;
        }
        int res = 0;
        if(root.val==sum){
            res++;
        }
        res += find(root.left, sum-root.val);
        res += find(root.right, sum-root.val);
        return res;
    }
}