【Leetcode】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

题意：计算两个由逆序链表表示的正整数之和，并以逆序的链表输出。

这题较简单，为了节约空间，我没有新建结点，而是将结果保存在l1中，需要注意的有，当两个链表都走完时，如果此时的carrier（进位）为1，不要忘记要新建一个结点保存carrier的值。还有就是要用pre来维护链表之间的衔接。

class Solution {
public:
    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if(l1==NULL)
            return l2;
        if(l2==NULL)
            return l1;
        ListNode *Node1=l1,*Node2=l2,*pre=l1;
        int carrier=0;
        int num;
        while(Node1!=NULL&&Node2!=NULL)
        {
            num=Node1->val+Node2->val+carrier;
            if(num<10)
            {
                Node1->val=num;
                carrier=0;
            }
            else
            {
                Node1->val=num-10;
                carrier=1;
            }
            pre=Node1;
            Node1=Node1->next;
            Node2=Node2->next;
        }
        while(Node1!=NULL)
        {
            num=Node1->val+carrier;
            if(num<10)
            {
                Node1->val=num;
                carrier=0;
            }
            else
            {
                Node1->val=num-10;
                carrier=1;
            }
            pre=Node1;
            Node1=Node1->next;
        }
        while(Node2!=NULL)
        {
            num=Node2->val+carrier;
            if(num<10)
            {
                Node2->val=num;
                pre->next=Node2;
                carrier=0;
            }
            else
            {
                Node2->val=num-10;
                pre->next=Node2;
                carrier=1;
            }
            pre=Node2;
            Node2=Node2->next;
        }
        if(carrier)
        {
            ListNode *node=new ListNode(1);
            pre->next=node;
        }
        return l1;
    }
};