LeetCode-Path Sum II<ERROR>

作者：disappearedgod

文章出处：http://blog.csdn.net/disappearedgod/article/details/38914997

时间：2014-8-29

题目

Path Sum II

  Total Accepted: 18280  Total Submissions: 67669 My Submissions

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.

For example:
Given the below binary tree and  sum = 22,

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

return

[
   [5,4,11,2],
   [5,8,4,5]
]

解法

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public class Node{
        TreeNode t;
        int nodeSum;
        ArrayList<Integer> list;
        Node(TreeNode tn, int s,ArrayList<Integer> l){
            t = tn;
            nodeSum = s;
            list = l;
        }
    }
    public ArrayList<ArrayList<Integer>> pathSum(TreeNode root, int sum) {
        ArrayList<Integer> list = new ArrayList<Integer>();
        ArrayList<ArrayList<Integer>> retList = new ArrayList<ArrayList<Integer>>();
        Queue<Node> q = new LinkedList<Node>();
        if(root == null)
            return retList;
        list.add(root.val);
        Node n = new Node(root, root.val, list);
        q.offer(n);
        while(!q.isEmpty()){
            Node node = q.poll();
            TreeNode t = node.t;
            int s = node.nodeSum;
            list = node.list;
            if(t.left != null){
                list.add(t.left.val);
                q.offer(new Node(t.left, t.left.val + s, list));
            }
            else if(t.right != null){
                list.add(t.right.val);
                q.offer(new Node(t.right, t.right.val + s, list));
            }
            else if(s == sum){
                if(!retList.contains(list))
                    retList.add(list);
            }
        }
        HashSet<ArrayList<Integer>> h = new HashSet<ArrayList<Integer>>(retList);
        retList.clear();
        retList.addAll(h);
        return retList;
    }
}

结果

Submission Result: Wrong Answer

Input:	{0,1,1}, 1
Output:	[[0,1]]
Expected:	[[0,1],[0,1]]

返回

 LeetCode Solution(持续更新，java>c++)