Add Two Numbers

You are given two linked lists representing two non-negative numbers. 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.

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) {
        if (!l1)
            return l2;
        if (!l2)
            return l1;
        ListNode *p, *q, *pre=NULL, *sum=NULL;
        int jinwei = 0;
        p = l1;
        q = l2;
        while (p && q) {
            ListNode *nex = new ListNode(p->val + q->val + jinwei);
            jinwei = nex->val / 10;
            nex->val = nex->val % 10;
            if (!sum) {
                sum = nex;
                pre = nex;
            }
            else {
                pre->next = nex;
                pre = pre->next;
            }
            p = p->next;
            q = q->next;
        }
        while (p) {
            pre->next = p;
            if (jinwei) {
                jinwei = (p->val + 1) / 10;
                pre->next->val = (p->val + 1) % 10;
            }
            p = p->next;
            pre = pre->next;
        }
        while (q) {
            pre->next = q;
            if (jinwei) {
                jinwei = (q->val + 1) / 10;
                pre->next->val = (q->val + 1) % 10;
            }
            q = q->next;
            pre = pre->next;
        }
        if (jinwei) {
            ListNode *nex = new ListNode(1);
            nex->val = 1;
            pre->next = nex;
            pre = pre->next;
        }
        pre->next = NULL;
        return sum;
    }
};