Leetcode_c/002_add_two_numbers.c at master · jiajunhit/Leetcode_c · GitHub

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
#include <stdio.h>
#include <stdlib.h>

struct ListNode {
    int val;
    struct ListNode *next;
}

struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2) {
    struct ListNode* p;
    struct ListNode* t;
    struct ListNode* o;
    int carry = 0;

    t = (struct ListNode*)malloc(sizeof(struct ListNode));
    t->val = 0;
    t->next = NULL;

    p = t;
    while (l1 || l2) {
        if (l1 == NULL) {
            o = (struct ListNode*)malloc(sizeof(struct ListNode));
            o->val = (l2->val + carry) % 10;
            o->next = NULL;

            carry = (l2->val + carry) / 10;

            t->next = o;
            t = o;

            l2 = l2->next;
        } else if (l2 == NULL) {
            o = (struct ListNode*)malloc(sizeof(struct ListNode));
            o->val = (l1->val + carry) % 10;
            o->next = NULL;

            carry = (l1->val + carry) / 10;

            t->next = o;
            t = o;

            l1 = l1->next;
        } else {
            o = (struct ListNode*)malloc(sizeof(struct ListNode));
            o->val = (l1->val + l2->val + carry) % 10;
            o->next = NULL;

            carry = (l1->val + l2->val + carry) / 10;

            t->next = o;
            t = o;

            l1 = l1->next;
            l2 = l2->next;
        }
    }

    if (carry) {
            o = (struct ListNode*)malloc(sizeof(struct ListNode));
            o->val = carry;
            o->next = NULL;

            t->next = o;
    }

    p = p->next;

    return p;
}

int main() {
    st

    return 0;
}