LeetCode-002 Add Two Numbers

Description

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

Analyse

题目大意很简单，就一个高精度加法的链表形式，不需要考虑时间复杂度和空间复杂度的问题。我的代码有点长，主要是自己在写的时候，没想着把代码都写在一起，只是处理了该处理的问题。

Code

/**
 * 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 sum = 0, up = 0;
        ListNode *ans = NULL, *head;
        //up用来存进位，这里主要处理l1与l2最低位数的加法
        while (l1 != NULL && l2 != NULL) {
            if (up == 1) {
                sum = l1->val + l2->val + 1;
            } else {
                sum = l1->val + l2->val;
            }
            if (sum >= 10) {
                sum -= 10;
                up = 1;
            } else {
                up = 0;
            }
            if (ans == NULL) {
                ans = new ListNode(sum);
                head = ans;
            } else {
                ListNode* nextnum = new ListNode(sum);
                ans->next = nextnum;
                ans = ans->next;
            }
            l1 = l1->next;
            l2 = l2->next;
        }
        //多余的位数的加法再后面这里特殊处理
        while (l1 != NULL) {
            ListNode *nextnum;
            if (up == 1) {
                if (l1->val + 1 >= 10) {
                    nextnum = new ListNode(l1->val - 9);
                } else {
                    nextnum = new ListNode(l1->val + 1);
                    up = 0;
                }
            } else {
                nextnum = new ListNode(l1->val);
            }
            ans->next = nextnum;
            ans = ans->next;
            l1 = l1->next;
        }
        while (l2 != NULL) {
            ListNode *nextnum;
            if (up == 1) {
                if (l2->val + 1 >= 10) {
                    nextnum = new ListNode(l2->val - 9);
                } else {
                    nextnum = new ListNode(l2->val + 1);
                    up = 0;
                }
            } else {
                nextnum = new ListNode(l2->val);
            }
            ans->next = nextnum;
            ans = ans->next;
            l2 = l2->next;
        }
        //若加完之后还有进位，则还需要处理一下，如99+1=100
        if (up == 1) {
            ListNode *nextnum = new ListNode(1);
            ans->next = nextnum;
        }
        return head;
    }
};

其实这里的许多while循环都可以用if语句去合并，比如说多余的位数处理可以一般化的，若一个为NULL而另一个不为NULL，则视作加零即可。不过当时没想这么多。