FilesExpand file tree

 master

/

subsets.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

51 lines (31 loc) · 1003 Bytes

 master

/

subsets.java

Copy path

Top

File metadata and controls

• Code
• Blame

51 lines (31 loc) · 1003 Bytes

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

// Given a set of distinct integers, nums, return all possible subsets.

// Note: The solution set must not contain duplicate subsets.

// For example,

// If nums = [1,2,3], a solution is:

// [

// [3],

// [1],

// [2],

// [1,2,3],

// [1,3],

// [2,3],

// [1,2],

// []

// ]

public class Solution {

public List<List<Integer>> subsets(int[] nums) {

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

recurse(result, nums, new Stack<>(), 0);

return result;

}

private void recurse(List<List<Integer>> result, int[] nums, Stack path, int position) {

if(position == nums.length) {

result.add(new ArrayList<>(path));

return;

}

path.push(nums[position]);

recurse(result, nums, path, position + 1);

path.pop();

recurse(result, nums, path, position + 1);

}

}