【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

思路: 题乍一看不难,但是细节挺烦。顺序遍历，每两个值相加，但问题在于和大于10时如何处理。我用了一个布尔值记录进位情况。但最后迟迟不过的原因都是在于特殊情况上。比如两个链表长度不等，以及最后一位依然有进位怎么处理等，细节问题太多。

代码如下：

/**
 * 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 || !l2) return NULL;
        ListNode *tmp1 = l1;
        ListNode *tmp2 = l2;
        //ListNode *tmp = l1;
        bool carry=false;
        
        while(tmp1 && tmp2){
            if(carry)   tmp1->val = tmp1->val+tmp2->val+1;
            else tmp1->val = tmp1->val+tmp2->val;
            if(tmp1->val>10){
                tmp1->val -=10;
                carry=true;
            }
            else carry = false;
            if(!tmp1->next) break;
            tmp1=tmp1->next;
            tmp2=tmp2->next;
        }
        if (tmp2){
            tmp1->next = tmp2;
            tmp1 = tmp1->next;
        }
        while (tmp1&&carry){
            tmp1->val++;
            if(tmp1->val>10){
                tmp1->val-=10;
                carry=true;
            }
            else carry=false;
            if(tmp1->next) tmp1=tmp1->next;
            else {
                ListNode *nnode = (ListNode*)malloc(sizeof(ListNode));
                nnode->val = 1;
                tmp1->next = nnode;
                return l1;
            }
        }
        return l1;            
    }
};

手算了三遍，等脑子清醒了再来玩儿吧…

==================================================================================================================================

/**
 * 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 || !l2) return NULL;
        ListNode *tmp1 = l1;
        ListNode *tmp2 = l2;
        //ListNode *tmp = l1;
        bool carry=false;
        
        while(tmp1 && tmp2){
            if(carry)   tmp1->val = tmp1->val+tmp2->val+1;
            else tmp1->val = tmp1->val+tmp2->val;
            if(tmp1->val>=10){
                tmp1->val -=10;
                carry=true;
            }
            else carry = false;
            if(tmp1->next==NULL) break;
            tmp1=tmp1->next;
            tmp2=tmp2->next;
        }
        if (tmp2 && !tmp1->next){
            if(tmp2->next==NULL);
            else{
                tmp1->next = tmp2;
                tmp1 = tmp1->next;
            }
        }
        while (tmp1){
            if(carry){
                tmp1->val++;
                if(tmp1->val>=10){
                    tmp1->val-=10;
                    carry=true;
                }
                else carry=false;
            }
            if(tmp1->next==NULL) break;
            tmp1=tmp1->next;
        }
        if(carry){
            ListNode *nnode = (ListNode*)malloc(sizeof(ListNode));
            nnode->val = 1;
            tmp1 = nnode;
        }
        return l1;            
    }
};

QAQ...

================================================================================================================================

class Solution {
public:
    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
        if(l1 == NULL)
            return l2;
        else if(l2 == NULL)
            return l1;
        ListNode *l1Temp = l1;
        ListNode *l2Temp = l2;
        ListNode *longer,*shorter;
        int length1=0,length2=0,carry=0,temp=0;
        while(l1Temp != NULL)
        {
            length1++;
            l1Temp = l1Temp -> next;
        }
        while(l2Temp != NULL)
        {
            l2Temp = l2Temp->next;
            length2++;
        }
        if(length2 > length1)
        {
            longer = l2;
            shorter = l1;
        }
        else
        {
            longer = l1;
            shorter = l2;
        }
        l1Temp = longer;
        l2Temp = shorter;
        while(l1Temp != NULL && l2Temp != NULL)
        {
            if(carry != 0)
            {
                temp = l1Temp->val + l2Temp->val+carry;
                carry = 0;
            }
            else
            {
                temp = l1Temp->val + l2Temp->val;
            }
            if(temp > 9)
            {
                carry = temp / 10;
                l1Temp->val = temp%10;
            }
            else
            {
                l1Temp->val = temp;
            }
            l1Temp = l1Temp->next;
            l2Temp = l2Temp->next;
        }
        if(carry != 0)
        {
            while(l1Temp != NULL && carry != 0)
            {
                temp = l1Temp->val + carry;
                carry = temp / 10;
                l1Temp->val = temp % 10;
                l1Temp = l1Temp->next;
            }
            if(carry != 0)
            {
                ListNode *newNode = new ListNode(carry);
                l1Temp = longer;
                while(l1Temp->next != NULL)
                    l1Temp = l1Temp->next;
                l1Temp->next = newNode;
            }
        }
        return longer;
    }
};

整理一下，主要还是思路不够清晰的问题。之前用的算法会直接把l1认为长的那个，所以之后需要判断的情况就变得特别繁琐。后来网上查询后它的思路更清晰：先找出长的那个，再进行加减，这样就更容易写代码了。