FilesExpand file tree

 master

/

subsets_unique.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

38 lines (30 loc) · 716 Bytes

 master

/

subsets_unique.py

Copy path

Top

File metadata and controls

• Code
• Blame

38 lines (30 loc) · 716 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

# Given a collection of integers that might contain duplicates, nums,

# return all possible subsets.

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

# For example,

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

# [

# [2],

# [1],

# [1,2,2],

# [2,2],

# [1,2],

# []

# ]

def subsets_unique(nums):

res = set()

backtrack(res, nums, [], 0)

return list(res)

def backtrack(res, nums, stack, pos):

if pos == len(nums):

res.add(tuple(stack))

else:

# take

stack.append(nums[pos])

backtrack(res, nums, stack, pos+1)

stack.pop()

# don't take

backtrack(res, nums, stack, pos+1)

test = [1,2,2]

print(test)

print(subsets_unique(test))