2.AddTwoNumbers

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

（给定两个非空链表来表示两个非负整数，非负整数的各位数字在链表中的位置为逆序，将两个数字相加并返回它的链表。
假定两个数字都不以0开头，除非数字0本身。）

链表中的每个节点：

struct ListNode
{
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};

解法：

#include "stddef.h"

ListNode* AddTwoNumbers::addTwoNumbers(ListNode* l1, ListNode* l2)
{
    // 初始化头节点
    ListNode preHead(0), *p = &preHead;
    // 进位标志
    int extra = 0;
    // 两个链表相加到末尾且不在有进位的时候为结束
    while (l1 || l2 || extra)
    {
        int sum = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + extra;
        // 取相加后的进位和值
        extra = sum / 10;
        p->next = new ListNode(sum % 10);
        p = p->next;
        // 两个链表不断往下走，为空时停止
        l1 = l1 ? l1->next : l1;
        l2 = l2 ? l2->next : l2;
    }
    return preHead.next;
}

测试代码：

    AddTwoNumbers addTwoNumbers;
    ListNode preNum1(0), *headNum1 = &preNum1;
    headNum1->next = new ListNode(2);
    headNum1 = headNum1->next;
    headNum1->next = new ListNode(4);
    headNum1 = headNum1->next;
    headNum1->next = new ListNode(3);
    headNum1 = headNum1->next;

    ListNode preNum2(0), *headNum2 = &preNum2;
    headNum2->next = new ListNode(5);
    headNum2 = headNum2->next;
    headNum2->next = new ListNode(6);
    headNum2 = headNum2->next;
    headNum2->next = new ListNode(4);
    headNum2 = headNum2->next;

    ListNode *result = addTwoNumbers.addTwoNumbers(preNum1.next, preNum2.next);
    ListNode *printList = result;
    while (printList)
    {
        cout << printList->val << "\n";
        printList = printList->next;
    }
    cout << endl;