subsetII

最新推荐文章于 2025-05-16 00:45:00 发布

zwzcdcll

最新推荐文章于 2025-05-16 00:45:00 发布

阅读量193

点赞数

分类专栏：递归

本文链接：https://blog.youkuaiyun.com/zwzcdcll/article/details/100128785

版权

递归专栏收录该内容

1 篇文章

订阅专栏

#include<iostream>
#include<vector>

using namespace std;

class Solution {
public:
	vector<vector<int>> subsets(vector<int>& nums) {
		vector<vector<int>> res;
		vector<int> item;
		res.push_back(item);
		if(nums.empty()){
			return res; 
		}     
		int start = 0;
		for(int i = 0; i< nums.size(); i++){
			int size = res.size();	
			for(int j = start ; j< size; j++){
				vector<int> tmp = res[j];	
				vector<int> new_tmp = vector<int>(tmp);
				new_tmp.push_back(nums[i]);
				res.push_back(new_tmp);
			}
			if(nums[i]==nums[i+1] && i<nums.size()-1){
				 start = size;	
			}
			else{
				 start = 0;	
			}
		}
		return res;
	}
};
int main(){
	Solution so;
	vector<int> nums={1,2,2};
	vector<vector<int>> res = so.subsets(nums);
	for(int i = 0; i < res.size(); i++){
		for(int j = 0; j < res[i].size(); j++){
			cout<< res[i][j] << ",";
		}	
		cout << "**************************"<< endl;
	}
}