[LeetCode]Subsets@python

最新推荐文章于 2019-01-10 11:23:35 发布

benjamin_sunny_li

最新推荐文章于 2019-01-10 11:23:35 发布

阅读量515

点赞数

CC 4.0 BY-SA版权

文章标签： leetcode dfs

本文链接：https://blog.youkuaiyun.com/weixin_38111819/article/details/79194785

本文介绍了一种使用深度优先搜索(DFS)算法生成给定整数数组所有可能子集的方法，并提供了一个Python代码示例。该算法确保了结果中没有重复的子集。

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

Note: The solution set must not contain duplicate subsets.

For example,
If nums = [1,2,3], a solution is:

[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]

思路：dfs

class Solution(object):
    def subsets(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        res = []
        self.dfs(nums, res, 0 , [])
        return res
        
    def dfs(self, nums, res, index, path):
        res.append(path)
        for i in range(index,len(nums)):
            self.dfs(nums, res, i+1, path+[nums[i]] )