#include <iostream>
#include <vector>
using namespace std;
void recursivePrint(vector<char> number,int length,int index)
{
if(index == length - 1)
{
for(int i = 0 ; i < length; ++i)
cout << number[i] ;
cout << endl;
return;
}
for(int i = 0; i < 10; ++i)
{
number[index + 1] = i + '0';
recursivePrint(number,length,index + 1);
}
}
void printFullSortNumbers(int n)
{
if(n == 0)
return ;
vector<char> res(n+1,'0');
for(int i = 0; i < 10; i ++)
{
res[0] = i +'0';
recursivePrint(res,n,0);
}
}
int main()
{
int a = 2;
printFullSortNumbers(a);
retur
c++实现数字的全排列
最新推荐文章于 2024-05-12 16:40:52 发布