@@ -0,0 +1,529 @@
+class Solution:%0A    # @param %7Binteger%5B%5D%7D nums%0A    # @return %7Binteger%5B%5D%5B%5D%7D%0A    def subsets(self, nums):%0A        nums.sort()%0A        res = %5B%5B%5D%5D%0A        for i in range(1, len(nums) + 1):%0A            res += self.subset(i, nums)%0A        return res%0A    %0A    def subset(self, i, nums):%0A        if i == 0:%0A            return %5B%5B%5D%5D%0A        %0A        res = %5B%5D%0A        for j in range(len(nums) - i + 1):%0A            tmp = self.subset(i - 1, nums%5Bj + 1:%5D)%0A            for t in tmp:%0A                res.append(%5Bnums%5Bj%5D%5D + t)%0A        return res%0A

Create Subsets_001.py