LeetCode2. Add Two Numbers

题目

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

思路

最低有效位在表头，所以只需同时遍历两个链表相加即可，比较简单。可以看看另一题则是最高有效位在表头。

代码

/**
 * 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) {

        int sum = 0, carry = 0;

        ListNode *res = nullptr, *curr = nullptr;

        while(l1 || l2 || carry) {

            sum = 0;

            if(l1) {
                sum += l1->val;
                l1 = l1->next;
            }

            if(l2) {
                sum += l2->val;
                l2 = l2->next;
            }

            sum += carry;

            if(!res) {
                curr = new ListNode(sum % 10);
                res = curr;
            }
            else {
                curr->next = new ListNode(sum % 10);
                curr = curr->next;
            }

            carry = sum / 10;
        }

        return res;
    }
};