Lintcode 17. Subsets (Medium) (Python)

最新推荐文章于 2020-05-06 22:41:03 发布

2Young2Simple

最新推荐文章于 2020-05-06 22:41:03 发布

阅读量212

点赞数

CC 4.0 BY-SA版权

分类专栏： Lintcode刷题文章标签： Lintcode Python

本文链接：https://blog.youkuaiyun.com/weixin_41677877/article/details/81323725

Lintcode刷题专栏收录该内容

82 篇文章

订阅专栏

本文介绍了一个给定整数集合返回所有可能子集的算法实现，包括递归与迭代两种方法。通过具体示例展示了如何使用该算法求解特定输入的情况。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Subsets

Description:

Given a set of distinct integers, return all possible subsets.

Example
If S = [1,2,3], a solution is:

[
[3],
[1],
[2],
[1,2,3],
[1,3],
[2,3],
[1,2],
[]
]
Challenge
Can you do it in both recursively and iteratively?

Code:

class Solution:
    """
    @param nums: A set of numbers
    @return: A list of lists
    """
    res = []
    def helper(self, nums, index, father):
        self.res.append(father)
        for i in range(index, len(nums)):
            self.helper(nums, i+1, father+[nums[i]])

    def subsets(self, nums):
        # write your code here
        if len(nums) == 0:
            return [[]]
        self.helper(sorted(nums), 0, [])
        return self.res