LeetCode 91. Subsets

最新推荐文章于 2022-05-23 14:55:24 发布

stephen_wong

最新推荐文章于 2022-05-23 14:55:24 发布

阅读量743

点赞数

分类专栏： LeetCode LeetCode Problems 文章标签： LeetCode C++

本文链接：https://blog.csdn.net/stephen_wong/article/details/38138089

版权

LeetCode 同时被 2 个专栏收录

186 篇文章 0 订阅

订阅专栏

LeetCode Problems

183 篇文章 2 订阅

订阅专栏

排序S, 用vector<int> num记录不同的数字，用vector<int> cnt为这些数字计数。（怎么感觉之前在LeetCode做过一样的题..）

代码：

class Solution 
{
public:
    vector<vector<int> > subsetsWithDup(vector<int> &S) 
    {
    	if (S.empty())
    	{
    		return vector<vector<int>>();
    	}

    	sort(S.begin(), S.end());
    	num.push_back(S.front());
    	cnt.push_back(1);
    	for (size_t i = 1; i < S.size(); ++ i)
    	{
    		if (S[i] != S[i-1])
    		{
    			num.push_back(S[i]);
    			cnt.push_back(1);
    		} else
    		{
    			++ cnt.back();
    		}
    	}
    	vector<int> now;
    	for (size_t i = 0; i <= S.size(); ++ i)
    	{
    		gao(now, 0, i);
    	}

    	return ret;
    }
private:
	vector<int> num;
	vector<int> cnt;
	vector<vector<int>> ret;
	void gao(vector<int>& now, size_t index, size_t bound)
	{
		if (now.size() == bound)
		{
			ret.push_back(now);
			return ;
		}
		for (size_t i = index; i < num.size(); ++ i)
		{
			int j = 0;
			for (; j<cnt[i] && now.size()<bound; ++ j)
			{
				now.push_back(num[i]);
				gao(now, i+1, bound);
			}
			while (j --)
			{
				now.pop_back();
			}
		}
	}
};