LeetCode_Subsets II

最新推荐文章于 2020-12-16 23:46:01 发布

石头_奋斗

最新推荐文章于 2020-12-16 23:46:01 发布

阅读量808

点赞数

分类专栏： LeetCode 文章标签：算法

本文链接：https://blog.csdn.net/loveRooney/article/details/38382113

版权

LeetCode 专栏收录该内容

47 篇文章 0 订阅

订阅专栏

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

这题目是上一题目的扩展，继续BFS直接MLE，于是只能使用后来改进的算法，代码如下：

class Solution {
public:
    vector<vector<int> > subsetsWithDup(vector<int> &S) {
        vector <vector<int>> result(1);
        if(S.size()==0){
            return result;
        }
        
        //sort S in non-descending order
        sort(S.begin(),S.end());
        
        result.push_back(vector<int>(1,S[0]));
        int oldVal=S[0];
        int oldExtSubsets=1;
        
        for(int i=1;i<S.size();i++){
            
            //calculate the subs should be extended
            int extSubs=result.size();
            if(oldVal==S[i]){
                extSubs=result.size()-oldExtSubsets;
                oldExtSubsets+=extSubs;
            }
            else{
                oldExtSubsets=extSubs;
            }
            oldVal=S[i];
            
            //extend the subs should be extended
            int j=result.size()-1;
            for(int k=0;k<extSubs;k++){
                result.push_back(result[j-k]);
                result.back().push_back(S[i]);
            }
        }
        
        return result;
    }
};