2. Add Two Numbers

问题描述：

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

解题思路：

将两条链表的每个节点在循环时同时相加，然后生成新链表的节点。

class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        if((l1==NULL)&&(l2==NULL))
        {
            return NULL;
        }
        int count=0;
        ListNode *root=NULL;
        ListNode *tail=NULL;
        while(l1!=NULL||l2!=NULL)
        {
            if(l1!=NULL)
            {
                count+=l1->val;
                l1=l1->next;
            }
            if(l2!=NULL)
            {
                count+=l2->val;
                l2=l2->next;
            }
            ListNode *p=new ListNode(count%10);
            if(root==NULL)
            {
                root=p;
                tail=p;
            }else{
                tail->next=p;
                tail=p;
            }
            count=count/10;
        }
        if(count!=0){
            ListNode *p=new ListNode(count%10);
            if(root==NULL){
                root=p;
                tail=p;
            }
            else{
                tail->next=p;
                tail=p;
            }
        }
        return root;
    }
};