Leetcode题解：Add Two Numbers

题目内容

原题：https://leetcode.com/problems/add-two-numbers/description/

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.

Example

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

我们的算法要对输入的两个用链表表示的整数进行加法运算，并且结果也表示成链表的形式。一种做法便是可以先将两个链表转换为整数，并再将它们的和转换为链表，也就是需要实现链表到整数的相互转换。

也可以是模拟加法运算的过程，逐位相加并向前进位。具体过程如下：

/**
 * 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* head = NULL, *tail = NULL;
        ListNode* p = l1,*q = l2;
        int carry = 0;
        //通过循环同时对两个链表逐位相加，并记录进位
        while (p != NULL || q != NULL){
            int adder1 = p == NULL ? 0 : p->val;
            int adder2 = q == NULL ? 0 : q->val;
            int digit = (carry + adder1 + adder2) % 10;
            if(head == NULL) {
                head = new ListNode(digit);
                tail = head;
            }
            else {
                tail->next = new ListNode(digit);
                tail = tail->next;
            }
            carry = (carry + adder1 + adder2) / 10;
            if (p) {
                p = p->next; 
            }
            if (q) {
                q = q->next;
            }
        }
        if (carry != 0) {
            tail->next = new ListNode(carry);
        }
        return head;
    }
};