-
Notifications
You must be signed in to change notification settings - Fork 103
/
print1toN.c
90 lines (84 loc) · 1.48 KB
/
print1toN.c
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
#include <stdio.h>
//从一打印到n,要考虑大数
int plusOne(char *c)
{
if (*c<='9'&&*c>='0')
{
if (*c == '9')
{
*c = '0';
return 1;
}
else
{
(*c)++;
return 0;
}
}
return -1;
}
int stringPlusOne(char *str)
{
int plus = 0, i = strlen(str) - 1;
plus = plusOne(&str[i--]);
for (; i >= 0; i--)
{
if (plus == 1)
plusOne(&str[i]);
else
break;
if (plus == -1)
return -1;
}
for (i = 0; i < strlen(str); i++)
if (str[i] == '0')
continue;
else
return 0;
return 1;
}
int print1toMax(int n)
{
int i;
char num[100];
for (i = 0; i < n; i++)
num[i] = '0';
num[i] = '\0';
while (stringPlusOne(num) == 0)
{
printf("%s\n", num);
}
if (stringPlusOne == -1)
return -1;
return 0;
}
void print1toNmax(int n)
{
int i;
char str[100];
str[n] = '\0';
print1toMaxRecurse(str, strlen(str), 0);
}
void printCharNum(char *str)
{
while (*str == '0')
str++;
if (*str == '\0')
printf("%d\n", 0);
else
printf("%s\n", str);
}
void print1toMaxRecurse(char *str, int len, int index)
{
int i;
if (index == len)
{
printCharNum(str);
return;
}
for (i = 0; i < 10; i++)
{
str[index] = i + '0';
print1toMaxRecurse(str, len, index + 1);
}
}