leetcode2 Add Two Numbers链表相加

今早出的题，路上看了群里的小伙伴的思路，自己也码了如下code，没什么可说的，读懂题，知道链表结构就明白了80%

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.

# 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
        """
        #初始化进位
        increment = 0
        #初始化返回值
        rtn = cal = ListNode(0)
      
        while True:
            total = 0
            if l1!=None and l2!=None:
                total = l1.val+l2.val+increment
                cal.val = total%10
                increment = total/10
                l1=l1.next
                l2=l2.next
            elif l1!=None:
                total = l1.val+increment
                cal.val = total%10
                increment = total/10
                l1=l1.next
            elif l2!=None:
                total = l2.val+increment
                cal.val = total%10
                increment = total/10
                l2=l2.next
            elif increment!=0:
                cal.val = increment
                break
            else:
                break
        
            #指向下一位
            if l1!=None or l2!=None or increment:
                cal.next = ListNode(0)
                cal = cal.next
            else:
                break


        
        return rtn