leetcode未整理合集

78

class Solution(object):
    def subsets(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        length=len(nums)
        if length==0:
            return [[]]
        n=nums.pop(-1)
        ret=self.subsets(nums)
        length=len(ret)
        for i in range(length):
            ret.append(ret[i][:])
            ret[-1].append(n)
        return ret
        

class Solution(object):
    def subsets(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        ret=[]
        track=[]
        self.backtrack(track,0,nums,ret)
        return ret
    
    def backtrack(self,track,st,nums,ret):
        ret.append(track[:])
        for i in range(st,len(nums)):
            track.append(nums[i])
            self.backtrack(track,i+1,nums,ret)
            track.pop(-1)

https://mp.weixin.qq.com/s/qT6WgR6Qwn7ayZkI3AineA

https://leetcode-cn.com/problems/subsets/