17_Print1ToMaxOfNDigits（打印1到最大的N位数）

面试题17：打印1到最大的n位数
题目：输入数字n，按顺序打印出从1最大的n位十进制数。比如输入3，则

打印出1、2、3一直到最大的3位数即999。

解题思路：为防止溢出需要用字符串存数字

void Print1ToMaxOfNDigits_1(int n)
{
	char *numbers = new char[n + 1];
	memset(numbers, '0', n);
	numbers[n] = '\0';
	while (!Increment(numbers))
	{
		PrintNumber(numbers);
	}
	delete[] numbers;

	return;
}

void PrintNumber(char* number)
{
	int len = strlen(number);
	bool isbegin = true;
	for (int i = 0; i < len; ++i)
	{
		if (number[i] != '0' && isbegin)
			isbegin = false;
		if (!isbegin)
			printf("%c", number[i]);
	}
	printf("\n");

}

bool Increment(char* number)
{
	bool isOverflow = false;
	int takeOver = 0;
	int len = strlen(number);
	for (int i = len - 1; i >= 0; --i)
	{
		int sum = number[i] - '0' + takeOver;
		if (i == len - 1)
			++sum;
		if (sum >= 10)
		{
			if (i == 0)
				isOverflow = true;
			else
			{
				takeOver = 1;
				sum -= 10;
				number[i] = '0' + sum;
			}
		}
		else
		{
			number[i] = '0' + sum;
			break;
		}
	}
	return isOverflow;
}

方法二：递归的解法，依次将每一位从‘0’变为‘9’，PrintNumber和上面的方法一样。

void Print1ToMaxOfNDigits_2(int n)
{
	char *numbers = new char[n + 1];
	memset(numbers, '0', n);
	numbers[n] = '\0';
	int len = strlen(numbers);

	for (int i = 0; i < 10; ++i)
	{
		numbers[0] = '0' + i;
		Print1ToMaxOfNDigitsRecursively(numbers, len, 1);
	}
	delete[] numbers;
	return;
}

void Print1ToMaxOfNDigitsRecursively(char* number, int length, int index)
{
	if (index == length)
	{
		PrintNumber(number);
		return;
	}

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

}