-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathany_two_numbers_add.c
More file actions
178 lines (157 loc) · 2.73 KB
/
any_two_numbers_add.c
File metadata and controls
178 lines (157 loc) · 2.73 KB
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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
/* 实现一个函数完成任意两个数的加法 */
#include <stdio.h>
#include <string.h>
void judge_carry(int *s, int *c)
{
*c = 0;
if (*s >= 10)
{
*c = 1;
*s %= 10;
}
else if (*s < 0)
{
*c = -1;
*s = 10 + (*s);
}
}
void reverse(char *str1, char *str2)
{
char tmp = 0;
while (str1 < str2)
{
tmp = *str1;
*str1 = *str2;
*str2 = tmp;
str1++;
str2--;
}
}
char *any_two_nums_add_core(const char *elem1, int flag1, const char *elem2, int flag2, char *result)
{
int carry = 0;
int sum = 0;
const char *e1 = elem1;
const char *e2 = elem2;
char *ret = result;
if (('\0' == *elem1) || ('\0' == *elem2))
return NULL;
while ((*e1 >= '0') && (*e1 <= '9'))
e1++;
while ((*e2 >= '0') && (*e2 <= '9'))
e2++;
e1--;
e2--;
while ((e1 >= elem1) && (e2 >= elem2))
{
if (flag1 == flag2)
sum = *e1 - '0' + *e2 - '0' + carry;
else
sum = flag1 * (*e1 - '0') + flag2 * (*e2 - '0') + carry;
judge_carry(&sum, &carry);
*result = sum + '0';
e1--;
e2--;
result++;
}
while (e1 >= elem1)
{
sum = (*e1 - '0') + carry;
*result = sum + '0';
result++;
e1--;
}
while (e2 >= elem2)
{
sum = (*e2 - '0') + carry;
judge_carry(&sum, &carry);
*result = sum + '0';
result++;
e2--;
}
if (1 == carry) //还有进位
*result++ = 1 + '0';
if (flag1 * flag2 == -1)
*result++ = '-';
*result = '\0';
return ret;
}
char *any_two_nums_add(const char *elem1, const char *elem2, char *result)
{
int flag1 = 1;
int flag2 = 1;
char *ret = NULL;
char *tmp =NULL;
char *first = NULL;
if (NULL == elem1 || elem2 == NULL)
return NULL;
if (('\0' == *elem1) || ('\0' == *elem2))
return NULL;
if ('-' == *elem1)
{
flag1 = -1;
elem1++;
}
if ('+' == *elem1)
{
elem1++;
}
if ('-' == *elem2)
{
flag2 = -1;
elem2++;
}
if ('+' == *elem2)
{
elem2++;
}
if (((-1 == flag1) && (-1 == flag2)) || ((1 == flag1) && (1 == flag2)))
{
ret = any_two_nums_add_core(elem1, flag1, elem2, flag2, result);
tmp = ret;
if (flag1 == -1)
{
while (*tmp)
tmp++;
*tmp = '-';
*(tmp + 1) = '\0';
}
reverse(ret, tmp);
if (-1 == flag1)
first = ret + 1;
}
else
{
ret = any_two_nums_add_core(elem1, flag1, elem2, flag2, result);
tmp = ret;
while (*tmp)
tmp++;
reverse(ret, tmp - 1);
first = ret + 1;
}
tmp = first;
while (('0' == *(tmp + 1)) && ('0' == *tmp))
tmp++;
if (0 == *tmp)
tmp++;
if (*tmp > '0' && *tmp <= '9')
memmove(first, tmp, strlen(tmp) + 1);
else
*(first + 1) = '\0';
if (('-' == *ret) && ('0' == *(ret + 1)))
{
*ret = '0';
*(ret + 1) = '\0';
}
return ret;
}
int main()
{
char arr[20] = {0};
char *ret = any_two_nums_add("-99999","-99999999", arr);
if (ret)
printf("%s\n", arr);
else
printf("输入不合法\n");
return 0;
}