LeetCode- python [Add Two Numbers]

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.

使用单向链表：

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

class Solution:
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """

        result = None  #指向链表的首地址
        pre = None  # 动态指针
        flag = 0  
        while (l1 is not None) or (l2 is not None):  
            val = l1.val + l2.val + flag  
            flag = val // 10  #判断是否超过10,超过进位标志置为1

            node = ListNode(val % 10)  
            if result is None:  
                result = node  # result 指向刚刚创建的节点node， 之后一直指向链表的头不动
                pre = node  # pre动态索引链表
            else:  
                pre.next = node   # 先把链表连起来，由上一个指向这一个，pre不停地指向新的下一个节点 然后更新pre 
                pre = pre.next # 若改成node， python3测试不过， python2可以过  
            if  (l1 is not None):  
                l1 = l1.next  
            if (l2 is not None):  
                l2 = l2.next  

        if flag == 1:  
            pre.next = ListNode(1)  #最后如果还会进位的话 需要再创建一个新的结点 存放1 , 最大是1

        return result #指向的是链表的头  

---