剑指offer——面试题12：打印1到最大的n位数

来源：互联网发布：杨辉三角c语言程序详细编辑：程序博客网时间：2024/06/09 12:36

void Print1ToMaxOfNDigits_1(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表示一个数字，在 number上增加1// 如果做加法溢出，则返回true；否则为falsebool 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;}

// 字符串number表示一个数字，数字有若干个0开头// 打印出这个数字，并忽略开头的0void 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)        {            printf("%c", number[i]);        }    }     printf("\t");}

void Print1ToMaxOfNDigits_2(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;} 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);    }}

0 0