剑指Offer10 打印1到最大n位数

 /*************************************************************************
     > File Name: 10_PrintToMaxNum.c
     > Author: Juntaran
     > Mail: JuntaranMail@gmail.com
     > Created Time: 2016年08月30日 星期二 00时47分36秒
  ************************************************************************/

 #include <stdio.h>
 #include <malloc.h>
 #include <string.h>

 void PrintNumber(char* number)
 {
     bool isBeginning0 = true;
     int length = strlen(number);

     for (int i = ; i < length; ++i)
     {
         if (isBeginning0 && number[i]!='')
             isBeginning0 = false;

         if (!isBeginning0)
             printf("%c", number[i]);
     }
     printf("\t");
 }

 bool Increment(char* number)
 {
     bool isOverflow = false;
     int length = strlen(number);
     int TakeOver = ;

     for (int i = length-; i >= ; i--)
     {
         int sum = number[i] - '' + TakeOver;    // 进位
         if (i == length - )
             sum ++;

         if (sum >= )
         {
             if (i == )
                 isOverflow = true;
             else
             {
                 sum -= ;
                 TakeOver = ;
                 number[i] = sum + '';
             }
         }
         else
         {
             number[i] = sum + '';
             break;
         }
     }
     return isOverflow;
 }

 // 从1打印到最大的n位数
 void PrintToMaxNum1(int n)
 {
     if (n <= )
         return;

     char* number = (char*)malloc(sizeof(char)*(n+));
     memset(number, '', n);
     number[n] = '\0';

     while (!Increment(number))
     {
         PrintNumber(number);
     }
     free(number);
 }

 /************************************************************************/
 // 递归写法
 void PrintToMaxNumRecursively(char* number, int length, int index)
 {
     if (index == length-)
     {
         PrintNumber(number);
         return;
     }
     for (int i = ; i < ; ++i)
     {
         number[index+] = i + '';
         PrintToMaxNumRecursively(number, length, index+);
     }
 }

 void PrintToMaxNum2(int n)
 {
     if (n <= )
         return;

     char* number = (char*)malloc(sizeof(char)*(n+));
     number[n] = '\0';

     for (int i = ; i < ; ++i)
     {
         number[] = i + '';
         PrintToMaxNumRecursively(number, n, );
     }
     free(number);
 }

 int main()
 {
     int n = ;
     PrintToMaxNum1(n);
     PrintToMaxNum2(n);
 }