leetcode 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.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

分析

题目是主要来讲是关于链表的操作，将所给的两个链表相加得到一个结果链表，也只是简单的指针的应用。
题目中稍微有点坑的地方是链表的第一个位是相对于数字的最低位……
解法很简单吧，
（1）如果所给的链表不长，可以通过将链表转化为整数相加后再转化回去，完全省去了指针的操作，但是这样也就达不到练习的目的了。
（2）所以正常的解法是通过两个指针，同步遍历链表，并维护一个进位来获得结果链表。

代码

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* addTwoNumbersHelp(ListNode* l1, ListNode* l2, int bigSize, int smallSize) {
        int carry = (l1->val + l2->val) / 10;
        ListNode* result = new ListNode((l1->val + l2->val) % 10);
        l1 = l1->next;
        l2 = l2->next;
        ListNode* cur = result;
        for (int i = 0; i < smallSize - 1; i++) {
            ListNode *resultNode = new ListNode((l1->val + l2->val + carry) % 10);
            carry = (l1->val + l2->val + carry) / 10;
            l1 = l1->next;
            l2 = l2->next;
            cur->next = resultNode;
            cur = cur->next;
        }
        for (int i = smallSize; i < bigSize; i++) {
            ListNode *resultNode = new ListNode((l1->val + carry) % 10);
            carry = (l1->val + carry) / 10;
            l1 = l1->next;
            cur->next = resultNode;
            cur = cur->next;
        }
        return result;
    }


    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        if (l1 == NULL) return l2;
        if (l2 == NULL) return l1;
        int size1 = 0, size2 = 0;
        ListNode *cur1 = l1, *cur2 = l2;
        while (cur1 != NULL) {
            size1++;
            cur1 = cur1->next;
        }
        while (cur2 != NULL) {
            size2++;
            cur2 = cur2->next;
        }
        if (size1 < size2) {
            return addTwoNumbersHelp(l2, l1, size2, size1);
        } else {
            return addTwoNumbersHelp(l1, l2, size1, size2);
        }
    }
};

运行结果