Given a set of distinct integers, nums, return all possible subsets (the power set). leetcode48

class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:
        res = [[]]
        for num in nums:
            for temp in res[:]:
                x = temp[:]
                x.append(x)
        return res