2. Add Two Numbers. Sol

重点是添加新的结点。

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 contains a single digit. Add the two numbers and return the sum as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example 1:

Input: l1 = [2,4,3], l2 = [5,6,4]
Output: [7,0,8]
Explanation: 342 + 465 = 807.

Example 2:

Input: l1 = [0], l2 = [0]
Output: [0]

Example 3:

Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
Output: [8,9,9,9,0,0,0,1]

Constraints:

• The number of nodes in each linked list is in the range [1, 100].
• 0 <= Node.val <= 9
• It is guaranteed that the list represents a number that does not have leading zeros.

class Solution:
    def addTwoNumbers(self, l1, l2):
        prehead = ListNode(-1)
        prehead.val = -1
        prev = prehead
        flag=0
        while l1 and l2:
            if l1.val+l2.val+flag>9:
                l1.val = l1.val+l2.val+flag-10
                flag = 1
            else:
                l1.val = l1.val+l2.val+flag
                flag=0           
            prev.next = l1
            l1 = l1.next
            l2 = l2.next            
            prev = prev.next
        ptr = l1 if l1 is not None else l2
        while ptr:
            if ptr.val+flag>9:
                ptr.val = ptr.val+flag-10
                flag = 1
            else:
                ptr.val = ptr.val+flag
                flag=0      
            prev.next = ptr
            ptr = ptr.next         
            prev = prev.next
        if flag ==1:
            tail = ListNode()
            tail.val=flag
            prev.next=tail
            tail.next=None      

        return prehead.next