全排列问题&&组合问题

#include <iostream>
using namespace std;

void print1ToMaxOfNdigit(char * number, int length, int index)
{
if(index == length){
cout << number << endl;
return;
}

for(int i = 0; i < 10; ++i)
{
number[index]=i+'0';
print1ToMaxOfNdigit(number,length,index+1);
}
}

void solution(int n)
{
if(n<0)
return;
char * number = new char[n+1];
number
='\0';
print1ToMaxOfNdigit(number,n,0);
delete []number;
}

int main() {
// your code goes here
solution(2);
return 0;
}