leetcode 腾讯精选练习（50 题）78.子集

原题目

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

Note: The solution set must not contain duplicate subsets.

Example:

Input: nums = [1,2,3]
Output:
[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]

思路

第一遍解法

网上好的解法

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

自己可以改进的地方

最简代码

获得的思考