-
Notifications
You must be signed in to change notification settings - Fork 0
/
0002#add_two_numbers#medium.c
54 lines (54 loc) · 1.36 KB
/
0002#add_two_numbers#medium.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
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2) {
struct ListNode* former = NULL;
struct ListNode* head = NULL;
int carry = 0;
while(l1 != NULL && l2 != NULL)
{
int temp = l1 -> val + l2 -> val + carry;
struct ListNode* new = (struct ListNode*)malloc(sizeof(struct ListNode));
new -> next = NULL;
new -> val = temp % 10;
carry = 0;
if(temp >= 10)
carry = 1;
if(head == NULL)
head = new;
else
former -> next = new;
former = new;
l1 = l1 -> next;
l2 = l2 -> next;
}
l1 = l1 ? l1 : l2;
while(l1 != NULL)
{
int temp = l1 -> val + carry;
struct ListNode* new = (struct ListNode*)malloc(sizeof(struct ListNode));
new -> next = NULL;
new -> val = temp % 10;
carry = 0;
if(temp >= 10)
carry = 1;
if(head == NULL)
head = new;
else
former -> next = new;
former = new;
l1 = l1 -> next;
}
if(carry > 0) //this was foggot by me, in which an extra carry digit was needed such as 1 + 99 = 100
{
struct ListNode* new = (struct ListNode*)malloc(sizeof(struct ListNode));
new -> next = NULL;
new -> val = carry;
former -> next = new;
}
return head;
}