[LeetCode]Add Two Numbers

题目

Number: 2
Difficulty: Medium
Tags: Linked List, Math

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

思路比较简单，两个指针同时边移动边相加，注意末尾进位的情况，如1+999。

代码

class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        int c = 0, i = 0;
        ListNode *p = l1, *q = l2;
        ListNode *pre = p;
        while(p && q)
        {
            p->val = p->val + q->val + c;
            if(p->val > 9)
            {
                c = 1;
                p->val -= 10;
            }
            else 
                c = 0;
            pre = p;
            p = p->next;
            q = q->next;
        }
        if(q)
        {
            pre->next = q;
            p = q;
        }
        while(c)
        {
            if(p)
            {
                p->val += c;
                if(p->val > 9)
                {
                    c = 1;
                    p->val -= 10;
                }
                else 
                   c = 0;
                pre = p;
                p = p->next;
            }
            else
            {
                ListNode* t = new ListNode(1);
                pre->next = t;
                c = 0;
            }
        }
        return l1;
    }
};

总结

思路简单，进一步压缩代码行数：

ListNode *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;
}