LeetCode 445. Add Two Numbers II--面试算法题--C++,Python解法

题目地址：Add Two Numbers II - LeetCode

---

You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first 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.

Follow up:
What if you cannot modify the input lists? In other words, reversing the lists is not allowed.

Example:

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

---

这道题目是XX面试时的算法题，难度是不大。
最容易想到的解法是把链表转成数字相加后再转成链表。
Python解法如下：

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
        num1, num2 = 0,0
        while l1 != None:
            num1 = num1*10+l1.val
            l1 = l1.next
        while l2 != None:
            num2 = num2*10+l2.val
            l2 = l2.next
        num = num1+num2
        root = ListNode(x=0)
        while num != 0:
            temp = num % 10
            root.val = temp
            num = num//10
            if num == 0:
                return root
            temp3 = ListNode(x=0)
            temp3.next = root
            root = temp3
        return root

这个做法有缺点，那就是如果数很大的话会比较麻烦，虽然Python的int可以无限大，但C语言就不能用这个解法了。
比较好的做法如下：

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None


class Solution:
    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
        list1, list2 = [], []
        while l1 != None:
            list1.append(l1)
            l1 = l1.next
        while l2 != None:
            list2.append(l2)
            l2 = l2.next
        if len(list1) < len(list2):
            list1, list2 = list2, list1
        for i in range(1, len(list2)+1):
            list1[-i].val = list1[-i].val+list2[-i].val
            if list1[-i].val >= 10:
                if i == len(list2):
                    while i < len(list1):
                        list1[-i].val -= 10
                        list1[-i-1].val += 1
                        if list1[-i-1].val >= 10:
                            i += 1
                        else:
                            break
                    if i == len(list1):
                        if list1[0].val >= 10:
                            root = ListNode(x=1)
                            root.next = list1[0]
                            list1[0].val -= 10
                            return root
                else:
                    list1[-i-1].val += 1
                    list1[-i].val -= 10
        return list1[0]

C++解法如下：

/**
 * 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)
    {
        vector<int> nums1, nums2;
        while (l1)
        {
            nums1.push_back(l1->val);
            l1 = l1->next;
        }
        while (l2)
        {
            nums2.push_back(l2->val);
            l2 = l2->next;
        }

        int m = nums1.size(), n = nums2.size();
        int sum = 0, carry = 0;

        ListNode *head = nullptr, *p = nullptr;

        for (int i = m - 1, j = n - 1; i >= 0 || j >= 0 || carry > 0; i--, j--)
        {
            sum = carry;
            if (i >= 0)
                sum += nums1[i];

            if (j >= 0)
                sum += nums2[j];

            carry = sum / 10;

            p = new ListNode(sum % 10);
            p->next = head;
            head = p;
        }

        return head;
    }
};