二维数组组合算法 C++

最新推荐文章于 2021-08-11 17:15:30 发布

TimeFuture2017

最新推荐文章于 2021-08-11 17:15:30 发布

阅读量499

点赞数

分类专栏： C++

本文链接：https://blog.csdn.net/Time2017/article/details/114641668

版权

C++ 专栏收录该内容

43 篇文章 4 订阅

订阅专栏

vector<vector<int>> Group(const vector<vector<int>>& vec)
{
	vector<vector<int>> curResult;
	
	
	//对第一个赋值
	int nlen = vec[0].size();
	for (int i = 0; i < nlen; ++i)
	{
		vector<int> vecTmp; vecTmp.push_back(vec[0][i]);
		curResult.push_back(vecTmp);
	}
	

	nlen = vec.size();
	for (int i = 1; i < nlen; ++i)
	{
		vector<vector<int>> newCurResult;
		const vector<int>& curSelectVec = vec[i];
		int jjlen = curSelectVec.size();
		for (int jj = 0; jj < jjlen; ++jj)
		{
			int curResultSize = curResult.size();
			for (int curIndex = 0; curIndex < curResultSize; ++curIndex) 
			{
				vector<int> curVecVec = curResult[curIndex];
				curVecVec.push_back(curSelectVec[jj]);
				newCurResult.push_back(curVecVec);
			}
		}
		curResult = newCurResult;
	}
	return curResult;
}

输入：{{1,2},{3,4}}

输出：{{1,3},{1,4},{2,3},{2,4}}