标签：pull pen desc question view turn 示例 obj rip
给定一组不含重复元素的整数数组 nums，返回该数组所有可能的子集（幂集）。
说明：解集不能包含重复的子集。
示例:
输入: nums = [1,2,3] 输出: [ [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]] """ res = [] self.dfs(res, [], nums, 0) return res def dfs(self, res, temp, nums, index): res.append(temp.copy()) # 注意要copy一下 for i in range(index, len(nums)): temp.append(nums[i]) self.dfs(res, temp, nums, i + 1) temp.pop() if __name__ == ‘__main__‘: s = Solution() print(s.subsets([1, 2, 3]))
标签：pull pen desc question view turn 示例 obj rip
原文地址：https://www.cnblogs.com/namedlxd/p/9502523.html
