本题源自LeetCode
--------------------------------------------------------------------------------------
大神的回溯法思路:http://blog.csdn.net/versencoder/article/details/52071930
回溯法求解
1 传统的 内存超时:
vector<vector<int> > subsetsWithDup(vector<int> &S) {
vector<vector<int>> result;
sort(S.begin(),S.end());
vector<int> list;
backTracing(S,0,result,list);
return result;
}
void backTracing(vector<int>& num,int start,vector<vector<int>>& result,vector<int>& list){
result.push_back(list);
for(int i=start;i<num.size();i++){
if(i>start&&num[i]==num[i-1])
continue;
list.push_back(num[i]);
backTracing(num,start+1,result,list);
list.pop_back();