-
Notifications
You must be signed in to change notification settings - Fork 0
/
12_Print1ToMaxOfNDigits.cpp
106 lines (87 loc) · 1.68 KB
/
12_Print1ToMaxOfNDigits.cpp
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
#include <stdio.h>
#include <string.h>
void PrintNumberStr(char* number) {
bool is0 = true;
int nLength = strlen(number);
for(int i = 0; i < nLength; i++) {
if (is0 == true && number[i] != '0')
is0 = false;
if(!is0)
printf("%c", number[i]);
}
if (!is0)
printf("\n");
}
bool Increment(char* number);
void Print1ToMaxOfNDigits(int n) {
if (n <= 0)
return;
char* number = new char[n+1];
memset(number, '0', n);
number[n] = '\0';
while(!Increment(number)) {
PrintNumberStr(number);
}
delete []number;
}
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, int n) {
while(*number != '\0') {
printf("%c", *number);
number++;
}
printf("\n");
}
void PrintNumberRecursively(char* number, int n, int index) {
if (index == n-1){
PrintNumberStr(number);
return;
}
for (int i = 0; i < 10; i++) {
number[index+1] = i + '0';
PrintNumberRecursively(number, n, index+1);
}
}
void Print1ToMaxOfNDigitsR(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';
PrintNumberRecursively(number, n, 0);
}
delete[] number;
}
int main() {
const int n = 5;
char *strNumber = new char[n+1];
Print1ToMaxOfNDigitsR(n);
/*
Print1ToMaxOfNDigits(n);
printf("\n");
*/
return 0;
}