【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    2      1

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

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
import java.util.*;
public class Solution {
    ArrayList<ArrayList<Integer>> res=new ArrayList<ArrayList<Integer>>();
    public boolean hasPathSum(TreeNode root, int sum) {
        if(root == null){
          return false;
        }
        ArrayList<Integer> list=new ArrayList<Integer>();
        list.add(root.val);
        dfs(root,sum-root.val,list);
        if(res.size() >0){
            return true;
        }else{
            return false;
        }
    }
    public void dfs(TreeNode root,int sum,ArrayList<Integer> list){
        if(root.left == null && root.right == null && sum == 0){
            res.add(list);
            return ;
        }
        if(root.left != null){
            ArrayList<Integer> leftList=new ArrayList<Integer>(list);
            leftList.add(root.left.val);
            dfs(root.left,sum-root.left.val,leftList);
        }
        if(root.right != null){
            ArrayList<Integer> rightList=new ArrayList<Integer>(list);
            rightList.add(root.right.val);
            dfs(root.right,sum-root.right.val,rightList);
        }
    }
}