[leetcode] #2 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

解题

刚开始想的是转化成int型数进行运算，然后再转化成链表的。

但后来想了想，这样做问题很大：

1. 链表可以很长，如几百位，转成int不现实；
2. 费力不讨好

所以还是直接在链表上做就好，所幸链表头是低位，不存在对齐的问题，唯一需要考虑的仅仅是进位。

/**
 * 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) {
        ListNode *r=new ListNode(0);
        ListNode *temp=r;
        ListNode *n=NULL;
        int over=0;

        while(l1&&l2)
        {
            temp->next=new ListNode(l1->val+l2->val);
            if (over)
            {
                temp->next->val++;
                over=0;
            }
            if (temp->next->val>9)
            {
                temp->next->val-=10;
                over=1;
            }
            temp=temp->next;
            l1=l1->next;
            l2=l2->next;
        }
        if (l1!=NULL)
            n = l1;
        else if (l2!=NULL)
            n = l2;

        while (n!=NULL)
        {
            temp->next=new ListNode(n->val);
            if (over)
            {
                temp->next->val++;
                over=0;
            }
            if (temp->next->val>9)
            {
                temp->next->val-=10;
                over=1;
            }
            temp=temp->next;
            n=n->next;
        }

        //这个进位比较容易丢
        if (over)
            temp->next=new ListNode(1);

        temp=r->next;
        delete r;
        return temp;
    }
};