LeetCode-78、子集-中等

LeetCode-78、子集-中等

给定一组不含重复元素的整数数组 nums，返回该数组所有可能的子集（幂集）。

说明：解集不能包含重复的子集。

示例:

输入: nums = [1,2,3]
输出:
[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]

 

代码1：回溯

class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:
        res = []
        length = len(nums)

        def backtrack(pl):
            if len(cur) == k:
                res.append(cur[:])
                return
            for i in range(pl, length-k+len(cur)+1):
                cur.append(nums[i])
                backtrack(i+1)
                cur.pop()
        
        for k in range(length+1):
            cur = []
            backtrack(0)
        
        return res

 

class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:
        res = []
        n = len(nums)
        
        def helper(i, tmp):
            res.append(tmp)
            for j in range(i, n):
                helper(j+1, tmp+[nums[j]])
        
        helper(0, [])
        return res

 

代码2：库函数

class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:
        res = []
        for i in range(len(nums)+1):
            for tmp in itertools.combinations(nums, i):
                res.append(tmp)
        return res

 

代码3：迭代

class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:
        res = [[]]
        for num in nums:
            res = res + [i+[num] for i in res]
        return res