C++ 从M个元素中取出N个元素组合

最新推荐文章于 2024-01-14 19:41:52 发布

qiuxue110

最新推荐文章于 2024-01-14 19:41:52 发布

阅读量702

点赞数 1

分类专栏： VC

本文链接：https://blog.csdn.net/qiuxue110/article/details/116309457

版权

VC 专栏收录该内容

53 篇文章 0 订阅

订阅专栏

/*
* Function return all possible combinations of k elements from N-size inputVector.
* The result is returned as a vector of k-long vectors containing all combinations.
*/
template<typename T> std::vector<std::vector<T>> getAllCombinations(const std::vector<T>& inputVector, int k)
{
	std::vector<std::vector<T>> combinations;
	std::vector<int> selector(inputVector.size());
	std::fill(selector.begin(), selector.begin() + k, 1);

	do {
		std::vector<int> selectedIds;
		std::vector<T> selectedVectorElements;
		for (int i = 0; i < inputVector.size(); i++) {
			if (selector[i]) {
				selectedIds.push_back(i);
			}
		}
		for (auto& id : selectedIds) {
			selectedVectorElements.push_back(inputVector[id]);
		}
		combinations.push_back(selectedVectorElements);
	} while (std::prev_permutation(selector.begin(), selector.end()));

	return combinations;
}