LeetCode: 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.

两个链表所代表的数字相加，返回结果，链表逆序存放，左边个位，右边高位。从l1和l2的头部开始迭代，相加后（carry也要加上）的结果个位存放在新链表当前位置，十位存放在carry里，所有指针后移一位。最后返回新链表。

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

class Solution(object):
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        l3 = ListNode(0)
        carry = 0
        cur = l3
        while l1 or l2:
            if l1 is None:
                a = 0
            else:
                a = l1.val
                l1 = l1.next
            if l2 is None:
                b = 0
            else:
                b = l2.val
                l2 = l2.next
            sum = a + b + carry
            value = sum % 10
            carry = sum // 10
            cur.val = value
            if l1 or l2:
                cur.next = ListNode(0)
                cur = cur.next
        if carry:
            cur.next = ListNode(1)
        return l3