-
Notifications
You must be signed in to change notification settings - Fork 0
/
addTwoNumbers2.c
63 lines (61 loc) · 1.53 KB
/
addTwoNumbers2.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
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2) {
struct ListNode l3, *ptr;
l3.val = 0;
ptr = &l3;
int sum, carry = 0;
while (l1 != NULL && l2 != NULL) {
sum = l1->val + l2->val + carry;
if (sum > 9) {
sum -= 10;
carry = 1;
} else {
carry = 0;
}
ptr->next = (struct ListNode*)malloc(sizeof(struct ListNode));
ptr->next->val = sum;
ptr = ptr->next;
l1 = l1->next;
l2 = l2->next;
}
while (carry == 1) {
if (l1 == NULL && l2 == NULL) {
ptr->next = (struct ListNode*)malloc(sizeof(struct ListNode));
ptr->next->val = 1;
ptr = ptr->next;
break;
} else if (l1 == NULL) {
l2->val += 1;
carry = 0;
ptr->next = l2;
if (l2->val > 9) {
l2->val -= 10;
carry = 1;
l2 = l2->next;
ptr = ptr->next;
}
} else {
l1->val += 1;
carry = 0;
ptr->next = l1;
if (l1->val > 9) {
l1->val -= 10;
carry = 1;
l1 = l1->next;
ptr = ptr->next;
}
}
}
if (l1 == NULL) {
ptr->next = l2;
} else {
ptr->next = l1;
}
return l3.next;
}