forked from lennylxx/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
43.c
52 lines (40 loc) · 1.06 KB
/
43.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
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char* multiply(char* num1, char* num2) {
if (num1 == NULL || num2 == NULL) return NULL;
int len1 = strlen(num1);
int len2 = strlen(num2);
int *prod = (int *)calloc(len1 + len2 + 1, sizeof(int));
int i, j, k = 0;
for (i = len1 - 1; i >= 0; i--) {
k = len1 - 1 - i;
for (j = len2 - 1; j >= 0; j--) {
prod[k++] += (num1[i] - '0') * (num2[j] - '0');
}
}
k++; /* the last carry digit */
/* carry all */
int c = 0;
for (i = 0; i < k - 1; i++) {
c = prod[i] / 10;
prod[i] = prod[i] % 10;
prod[i + 1] += c;
}
/* remove lead zeros */
while (k > 1 && prod[k - 1] == 0) k--;
char *ans = (char *)calloc(k + 1, sizeof(char));
/* reverse */
for (i = 0; i < k; i++) {
ans[i] = prod[k - 1 - i] + '0';
}
ans[k] = '\0';
free(prod);
return ans;
}
int main() {
char num1[] = "123456789";
char num2[] = "987654321";
printf("%s\n", multiply(num1, num2));
return 0;
}