【LeetCode】Algorithm 71～80：78

前言

本系列博客爲平時刷LeetCode的記錄，每十道題一篇博客，持續更新，所有代碼詳見GitHub：https://github.com/roguesir/LeetCode-Algorithm

78. Subsets

Introduce

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],
  []
]

Solution

class Solution(object):
    def subsets(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        result = [[]]
        for x in nums:
            result.extend([subset + [x] for subset in result])
        return result

https://leetcode.com/submissions/detail/202222494/

• 更新時間：2019-02-27