445. Add Two Numbers II

题意：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

思路：用个栈弹一下，顺序就正常了，在python中可以用list当做简单的栈，这里构建链表的时候注意要用头插法：

class Solution(object):
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        stack1, stack2 = [], []
        while l1:
            stack1.append(l1)
            l1 = l1.next
        while l2:
            stack2.append(l2)
            l2 = l2.next
        head = ListNode(0)
        val = carry = 0
        while len(stack1)>0 or len(stack2)>0 or carry:
            val = carry
            if len(stack1)>0:
                val += stack1.pop().val
            if len(stack2)>0:
                val += stack2.pop().val
            carry, val = divmod(val, 10)
            pre = ListNode(val)
            pre.next = head.next
            head.next = pre
        return head.next