1
# Runtime: 74 ms (Top 8.76%) | Memory: 14.1 MB (Top 82.26%)
2
class Solution:
3
    def subsets(self, nums: List[int]) -> List[List[int]]:
4
        self.final_list = []
5

6
        def subset(final_list, curr_list, listt, i):
7
            if i == len(listt):
8
                final_list.append(curr_list)
9
                return
10
            else:
11
                subset(final_list, curr_list, listt, i + 1)
12
                subset(final_list, curr_list + [listt[i]], listt, i + 1)
13

14
        subset(self.final_list, [], nums, 0)
15
        return self.final_list