#include <iostream>
#include <cmath>
using namespace std;
struct Node{
Node *children;
char *data;
};
void getnum(int n, int m);
int main()
{
getnum(4, 2);
return 0;
}
void putNode(Node& root, int m, int n, int &l)
{
if (l >= n)
{
cout<<root.data<<' ';
delete root.data;
return;
}
l += 1;
int i = 0;
root.children = new Node[m];
for (;i < m; i++)
{
int k = l;
root.children[i].data = new char[n + 1];
strcpy(root.children[i].data, root.data);
root.children[i].data[k - 1] = i + '0';
root.children[i].data[k] = '\0';
putNode(root.children[i], m, n, k);
}
delete root.data;
}
void getnum(int n, int m)
{
Node root;
int i = 0;
int j = 0;
root.data = new char[n + 1];
root.data[0] = '\0';
putNode(root, m, n, j);
};
追问看着晕啊