组合问题--排列数

题目：[1,2,3] [4,5] 进行组合
(1,4)(1,5)(2,4)(2,5)(3,4)(3,5)

思想就是排列树的思想

void Perm(vector<vector<int>> &arr,int k,vector<int>  &tmp)
{
	if(k == arr.size())
	{
		int n = tmp.size();
		for(int i = 0;i < n;++i)
		{
			cout << tmp[i] << " ";
		}
		cout << endl;
	}
	else
	{
		for(int i = 0;i < arr[k].size();++i)
		{
			tmp.push_back(arr[k][i]);
			Perm(arr,k+1,tmp);
			tmp.pop_back();
		}
	}
}