Given a set of distinct integers, nums, return all possible subsets (the power set).
Note: The solution set must not contain duplicate subsets.
class Solution(object):
def subsets(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
l = len(nums)
answer = [[]]
for i in range(0,l):
n = []
n.append(nums[i])
answer2 = []
if n not in answer:
for value in answer:
answer2.append(value[:])
value.append(nums[i])
answer = answer2[:]+answer
return answer
