Subsets_II.cpp

/*
 Author:     Weixian Zhou, ideazwx@gmail.com
 Date:       Jul 24, 2012
 Problem:    Subsets II
 Difficulty: 
 Source:     http://www.leetcode.com/onlinejudge
 Notes:
 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],
 []
 ]

 Solution:
 
 */
#include <vector>
#include <set>
#include <climits>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstring>
using namespace std;

class Solution {
public:
	vector<vector<int> > subsetsWithDup(vector<int> &S) {

	}
};