leetcode 2. Add Two Numbers

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.

Example:

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

 

我的解法，缺点是开辟了新的内存

/**
 * 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 move = 0, num = 0;
        ListNode* result =new ListNode(0);
        num = l1 -> val + l2 -> val + move;
        if (num>9) {move = num/10;num = num % 10;}
        result->val = num;
        ListNode* head = result;
        l1 = l1 -> next; l2 = l2 -> next;
        while(l1!= NULL && l2 != NULL){
            num = l1 -> val + l2 -> val + move;
            if (num>9) {move = num/10; num = num % 10;}
            else move = 0;
            head -> next = new ListNode(0);
            head = head -> next;
            head -> val = num;
            l1 = l1 -> next; l2 = l2 -> next;
        }
        while (l1 != NULL) {
            num = l1->val + move;
            if (num>9) {move = num/10; num = num % 10;}
            else move =0;
            head -> next = new ListNode(0);
            head = head -> next;
            head -> val = num;
            l1 = l1 -> next;
        }
         while (l2 != NULL) {
            num = l2->val + move;
            if (num>9) {move = num/10; num = num % 10;}
            else move = 0;
            head -> next = new ListNode(0);
            head = head -> next;
            head -> val = num;
            l2 = l2 -> next;
        }
        if (move != 0){
            head -> next = new ListNode(0);
            head = head -> next;
            head -> val = move;
        }
        return result;
    }
};