首页 > itarticle > 78. subsets

78. subsets

admin 11月 13, 2020 0

Medium

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

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

Note: The solution set must not contain duplicate subsets.

Example:

1
2
3
4
5
6
7
8
9
10
11
12
 
Input: nums = [1,2,3]
Output:
[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]

2019.08.29 独立做出来

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
 
import copy
class (object):
    def subsets(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        if len(nums)==0:
            return [[]]
        ans = [[]]
        for n in nums:
            len_ = len(ans)
            for i in range(len_):
                new = copy.deepcopy(ans[i])
                new.append(n)
                ans.append(new)
        return ans

类似题目：

Subsets II
Generalized Abbreviation
Letter Case Permutation

微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能