career cup 4.9

Careercup 4.9,You are given a binary tree in which each node contains a value. Design an algorithm to print all paths which sum up to that value. Note that it can be any path in the tree - it does not have to start at the root.
1 void findSum(TreeNode head, int sum, ArrayList<Integer> buffer,
2 int level) {
3 if (head == null) return;
4 int tmp = sum;
5 buffer.add(head.data);
6 for (int i = level;i >- 1; i--){
7 tmp -= buffer.get(i);
8 if (tmp == 0) print(buffer, i, level);
9 }
10 ArrayList<Integer> c1 = (ArrayList<Integer>) buffer.clone();
11 ArrayList<Integer> c2 = (ArrayList<Integer>) buffer.clone();
12 findSum(head.left, sum, c1, level + 1);
13 findSum(head.right, sum, c2, level + 1);
14 }
15
16 void print(ArrayList<Integer> buffer, int level, int i2) {
17 for (int i = level; i <= i2; i++) {
18 System.out.print(buffer.get(i) + “ ”);
19 }
20 System.out.println();
21 }比如我输入
                  5
               4    3
           6   7   2   8
sum = 12,有没有可能输入4 - 5 - 3
感觉答案里没有这种可能啊

题目说The path does not need to start or end at the root or a leaf, but it must go in a straight line down....看最后一句

mrno5zzz 发表于 2014-10-18 22:59
题目说The path does not need to start or end at the root or a leaf, but it must go in a straight lin ...

谢谢解答！4版的书没有最后一句，琢磨了好久