打印从1到最大的n位数

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138

/* * 输入数字n，按照顺序打印出从1到最大的n位十进制数，比如输入数字3，则打印出1，2，3一直到最大的3位数999. */   #include<iostream>   using namespace std;   //并没有考虑大数的解法 void Print1ToMaxOfDigits_1(int n) {     int number = 1;     int i = 0;     while (i++ < n)     {         number *= 10;     }       for (int i = 1; i < number; i++)     {         cout << i << " ";     } }   //用字符串来模拟大数的解法 bool Increment(char* number) {     bool isOverflow = false;     int nTakeOver = 0;     int nLength = strlen(number);     for (int i = nLength - 1; i >= 0; i--)     {         int nSum = number[i] - '0' + nTakeOver;         if (i == nLength - 1)             nSum++;           if (nSum >= 10)         {             if (i == 0)                 isOverflow = true;             else             {                 nSum -= 10;                 nTakeOver = 1;                 number[i] = '0' + nSum;             }         }         else         {             number[i] = '0' + nSum;             break;         }     }     return isOverflow; }   void PrintNumber(char* number) {     bool isBeginning0 = true;     int nLength = strlen(number);     for (int i = 0; i < nLength; ++i)     {         if (isBeginning0 && number[i] != '0')         {             isBeginning0 = false;         }           if (!isBeginning0)         {             cout << number[i];         }     }       cout << " "; }   void Print1ToMaxOfDigits(int n) {     if (n <= 0)         return;       char* number = new char[n + 1];     memset(number, '0', n);     number[n] = '\0';       while (!Increment(number))     {         PrintNumber(number);     }       delete[] number;     number = nullptr; }   //数字全排列的解法 void Print1ToMaxOfNDigitsRecursively(char* number, int length, int index) {     if (index == length - 1)     {         PrintNumber(number);         return;     }       for (int i = 0; i < 10; i++)     {         number[index + 1] = i + '0';         Print1ToMaxOfNDigitsRecursively(number, length, index+1);     } }   void Print1ToMaxOfNDigits(int n) {     if (n <= 0)         return;       char* number = new char[n + 1];     number[n] = '\0';       for (int i = 0; i < 10; i++)     {         number[0] = i + '0';         Print1ToMaxOfNDigitsRecursively(number, n, 0);     }       delete[] number;     number = nullptr; }   int main() {     int n;     cin >> n;     //Print1ToMaxOfDigits_1(n);       //Print1ToMaxOfDigits(n);       Print1ToMaxOfNDigits(n); }