未验证 提交 4b4e2483 编写于 作者: K KEQI HUANG 提交者: GitHub

Update 090._subsets_ii.md

上级 e2b4b306
###90. Subsets II
### 90. Subsets II
题目:
<https://leetcode.com/problems/subsets-ii/>
......@@ -9,6 +9,7 @@
思路:
参考别人的
现在来观察规律,与之前有不同之处是我们需要一个位置来mark,因为不再需要往之前出现过的地方再加了,看这个:
......@@ -25,9 +26,27 @@
```python
class Solution(object):
def subsetsWithDup(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
nums.sort()
results = [[]]
for i in range(len(nums)):
if any(nums[i] in result for result in results):
results.extend([result + [nums[i]] for result in results if result.count(nums[i]) == i - nums.index(nums[i])])
else:
results.extend([result + [nums[i]] for result in results])
return results
```
```
```python
class Solution(object):
def subsetsWithDup(self, nums):
"""
......@@ -44,4 +63,5 @@ class Solution(object):
result.append(result[j] + [nums[i]])
return result
```
\ No newline at end of file
```
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册