zoukankan      html  css  js  c++  java
  • Subsets II

    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],
    []
    ]

     1 class Solution {
     2 public:
     3     vector<vector<int>> subsetsWithDup(vector<int> &S) {
     4         vector<vector<int> > res(1, vector<int>());
     5         sort(S.begin(), S.end());
     6         vector<int> set;
     7         int N = S.size();
     8         for (int l = 1; l <= N; ++l)
     9             subsetsWithDupRe(S, l, 0, set, res);
    10         return res;
    11     }
    12 
    13     void subsetsWithDupRe(vector<int> &S, int L, int start, vector<int> &set, vector<vector<int>> &res)
    14     {
    15         int N = S.size(), M = set.size();
    16         if (M == L) {
    17             res.push_back(set);
    18             return;
    19         }
    20         for (int i = start; i <= N - (L - M); ++i) {
    21             if (i > start && S[i] == S[i-1]) continue; // important determint
    22             set.push_back(S[i]);
    23             subsetsWithDupRe(S, L, i + 1, set, res);
    24             set.pop_back();
    25         }
    26     }
    27 };
  • 相关阅读:
    Munge
    file upload custom form
    随笔摘要
    生成css 和 清缓存
    drupal commit 原则
    Git reset --hard
    www-data
    301/302的区别
    什么是request_uri
    in_array foreach array_search的性能比较
  • 原文地址:https://www.cnblogs.com/zhengjiankang/p/3646379.html
Copyright © 2011-2022 走看看