[Leetcode] #78#90 Subsets I & II

最新推荐文章于 2021-03-14 23:03:12 发布

努力的小陶

最新推荐文章于 2021-03-14 23:03:12 发布

阅读量280

点赞数 1

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_34264472/article/details/55106823

版权

LeetCode 专栏收录该内容

117 篇文章 0 订阅

订阅专栏

Discription:

Given a set of distinct integers, nums, return all possible subsets.

Note: The solution set must not contain duplicate subsets.

For example,
If nums = [1,2,3], a solution is:

[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]

Solution:

void subsets(vector<int>& nums, vector<vector<int>> &result, vector<int> &temp,int begin) {
	result.push_back(temp);
	for (int i = begin; i < nums.size(); i++){
		temp.push_back(nums[i]);
		subsets(nums, result, temp, i + 1);
		temp.pop_back();
	}
}

vector<vector<int>> subsets(vector<int>& nums) {
	vector<vector<int>> result;
	vector<int> temp;
	subsets(nums, result,temp, 0);
	return result;
}

Discription:

Given a collection of integers that might contain duplicates, nums, return all possible subsets.

Note: The solution set must not contain duplicate subsets.

For example,
If nums = [1,2,2], a solution is:

[
  [2],
  [1],
  [1,2,2],
  [2,2],
  [1,2],
  []
]

Solution:

void subsets(vector<int>& nums, vector<vector<int>> &result, vector<int> &temp,int begin) {
	result.push_back(temp);
	for (int i = begin; i < nums.size(); i++){
		if (i == begin || nums[i] != nums[i - 1]) {
			temp.push_back(nums[i]);
			subsets(nums, result, temp, i + 1);
			temp.pop_back();
		}
	}
}

vector<vector<int>> subsetsWithDup(vector<int>& nums) {
	sort(nums.begin(), nums.end());
	vector<vector<int>> result;
	vector<int> temp;
	subsets(nums, result,temp, 0);
	return result;
}

bool isDuplicate(vector<int>& nums, int begin, int i){
	while (i > begin){
		if (nums[i] == nums[begin])
			return false;
		i--;
	}
	return true;
}

void subsets(vector<int>& nums, vector<vector<int>> &result, vector<int> &temp,int begin) {
	result.push_back(temp);
	for (int i = begin; i < nums.size(); i++){
		if (!isDuplicate(nums, begin, i))
			continue;
		temp.push_back(nums[i]);
		subsets(nums, result, temp, i + 1);
		temp.pop_back();
		
	}
}

vector<vector<int>> subsetsWithDup(vector<int>& nums) {
	vector<vector<int>> result;
	vector<int> temp;
	subsets(nums, result,temp, 0);
	return result;
}

GitHub-Leetcode:https://github.com/wenwu313/LeetCode