LeetCode/2AddTwoNumbers at master · FireStoneYS/LeetCode · 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
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode *out = new ListNode(0);
        ListNode* tmp = out;
        int carry = 0;
        while(l1 || l2){
            int x = (l1)?l1->val:0;
            int y = (l2)?l2->val:0;
            int sum = x +y+carry;
            carry = sum / 10;
            int reminder =sum %10;
            tmp->next = new ListNode(reminder);
            tmp = tmp->next;
            if(l1) l1 = l1->next;
            if(l2) l2 = l2->next;

        }
        if(carry != 0){
            tmp->next = new ListNode(carry);
            tmp = tmp->next;
        }

        return out->next;

    }
};