LeetCode/Algorithms/SubsetsII.cs at master · codeyu/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
// Source : https://leetcode.com/problems/subsets-ii/?tab=Description
// Author : codeyu
// Date : Thursday, March 9, 2017 11:24:26 PM

/**********************************************************************************
*
*
* Given a collection of integers that might contain duplicates, nums, return all possible subsets.
*
* Note: The solution set must not contain duplicate subsets.
*
*
* For example,
* If nums = [1,2,2], a solution is:
*
*
*
* [
*   [2],
*   [1],
*   [1,2,2],
*   [2,2],
*   [1,2],
*   []
* ]
*
*
**********************************************************************************/

using System;
using System.Collections.Generic;
using Algorithms.Utils;
namespace Algorithms
{
public class Solution090 {
    public static IList<IList<int>> SubsetsWithDup(int[] nums) {throw new NotImplementedException("TODO");

    }
}}