8.11 练手 腾讯50题 78

Leetcode78. 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:

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

用递归写的，想法是子集将子集分为含有某个数和不含某个数， 即结果为 （第一个数和剩下数的子集）+(剩下数的子集)

代码如下：

class Solution(object):
    def subsets(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        #print(nums)
        if len(nums) ==0:
            return [[]]
        elif len(nums)==1:
            return [[],nums]
        else:
            n = len(nums)
            output =[]