FilesExpand file tree

 master

/

PathSumII.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

53 lines (48 loc) · 1.27 KB

 master

/

PathSumII.java

Copy path

Top

File metadata and controls

• Code
• Blame

53 lines (48 loc) · 1.27 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

import java.util.ArrayList;

/**

* 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]

* ]

*/

public class PathSumII {

public ArrayList<ArrayList<Integer>> pathSum(TreeNode root, int sum) {

ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();

if (root != null) {

ArrayList<Integer> path = new ArrayList<Integer>();

findPathSum(root, sum, result, path);

}

return result;

}

public void findPathSum(TreeNode root, int sum,

ArrayList<ArrayList<Integer>> result, ArrayList<Integer> path) {

if (root == null)

return;

if (root.left == null && root.right == null && root.val == sum) {

ArrayList<Integer> clone = new ArrayList<Integer>(path);

clone.add(root.val);

result.add(clone);

} else {

path.add(root.val);

if (root.left != null) {

findPathSum(root.left, sum - root.val, result, path);

}

if (root.right != null) {

findPathSum(root.right, sum - root.val, result, path);

}

path.remove(path.size() - 1);

}

}

}