leetcode90subsetii
2017-05-05 12:51
197 查看
class Solution(object):
def subsetsWithDup(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
nums.sort()
res=[]
line=[]
self.helper(nums,res,line)
return res
def helper(self,nums,res,line):
res.append([x for x in line])
for i,x in enumerate(nums):
if i>0 and nums[i]==nums[i-1]:
continue
line.append(x)
self.helper(nums[i+1:],res,line)
line.pop()
def subsetsWithDup(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
nums.sort()
res=[]
line=[]
self.helper(nums,res,line)
return res
def helper(self,nums,res,line):
res.append([x for x in line])
for i,x in enumerate(nums):
if i>0 and nums[i]==nums[i-1]:
continue
line.append(x)
self.helper(nums[i+1:],res,line)
line.pop()
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode78/90 subset I/II**
- LeetCode 练习： Subset ii
- Leetcode 78&90. Subsets I & II 【排列与组合的生成总结】
- 【leetcode】 subset I、II
- [Leetcode]@python 90. Subsets II.py
- Subset II leetcode java
- 90. Subsets II LeetCode
- [LeetCode] Subsets I (78) & II (90) 解题思路，即全组合算法
- LeetCode 90 Unique Paths II
- [leetcode 78 & 90, Medium] Subsets I and II
- 90.Subsets II leetcode java
- leetcode78、90-Subsets I/II(组合数/子集数目)
- leetcode之subset II
- <LeetCode OJ> 78 / 90 Subsets (I / II)
- subsetII leetcode c++
- Leetcode Subset I & II
- 【Leetcode】之Subset II
- [leetcode]219. Contains Duplicate II
- LeetCode_Combination Sum II
- leetcode之Wiggle Sort II