Subsets II

来源:互联网 发布:神经病有所好转 知乎 编辑:程序博客网 时间:2024/06/04 18:50

Given a collection of integers that might contain duplicates, S, return all possible subsets.
Note:
Elements in a subset must be in non-descending order. The solution set must not contain duplicate
subsets. For example, If S = [1,2,2], a solution is:
[
[2],
[1],
[1,2,2],
[2,2],
[1,2],
[]
]

0 0
原创粉丝点击