【LeetCode】 刷题 Add Two Numbers

【LeetCode】 刷题 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

二.解题思路
1.最笨的方法，先把第一个链表逆置，然后再和第二个链表相加，但是我一开始的做法会超时，如下：`
/**
* 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* new_l1 = reverseList(l1);
    int digit = 0; 

    ListNode *p1, *p2, *ret = NULL;
    p1 = new_l1;
    p2 = l2;

    int temp = 0;
    while(p1)
    {
        temp = p1->val + p2->val + digit;//有可能前面的计算有进位
        digit =0;
        if(temp > 9) 
            digit = 1;
        ListNode *tmpNode = new ListNode(temp % 10);
        tmpNode->next = ret;
        ret = tmpNode;
        delete tmpNode;
    }

    if (digit)
    {
        ListNode *tmpNode = new ListNode(1);
        tmpNode->next = ret;
        ret = tmpNode;
    }

    return ret;
}

ListNode* reverseList(ListNode* l1)
{   
    ListNode *curNode, *ret, *temp;
    curNode = l1;
    ret = NULL;
    temp = NULL;

    while(curNode){
        temp = curNode->next;
        curNode->next = ret;
        ret = curNode;
        curNode = temp;
    }

    return ret;

}

};`

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) {  
        int carry = 0;
        int val1, val2, temp;
        ListNode *ret = new ListNode(0);
        ListNode *ptr = ret;
        while(l1 || l2)
        {
            int val1 =0, val2 = 0;
            if(l1) 
            {
                val1 = l1->val;
                l1 = l1->next;
            }
            if(l2)
            {
                val2 = l2->val;
                l2 = l2->next;
            }
            temp = val1 + val2 + carry;
            carry = temp / 10;
            ptr->next = new ListNode(temp % 10);
            ptr = ptr->next;
        }

        if(carry)
            ptr->next = new ListNode(1); 

        return ret->next;
    }
};

这样写能够通过，但是效率极其低下，排在效率最末等，需要改进。