leetcode 2.两数相加python语言

题目

代码1

class ListNode():#数据结构：链表（类似于火车，一节一节连接起来的结构。可实现查询，添加，插入，删除元素）
    def __init__(self, x):#初始化有两个.val表示数据，.next表示下一个数据
        self.val = x
        self.next = None

class Solution():
    def addTwoNumbers(self, l1, l2):
        if l1 is None:
            return l2
        if l2 is None:
            return l1
        dummy=ListNode(0)#车头
        p=dummy
        carry=0

        while l1 or l2:
            tmpsum=0
            if l1:
                tmpsum=l1.val
                l1=l1.next
            if l2:
                tmpsum=tmpsum+l2.val
                l2=l2.next
            p.next=ListNode((tmpsum+carry)%10)
            carry=(tmpsum+carry)//10
            p=p.next
        if carry==1:
            p.next=ListNode(1)
        return dummy.next#从车厢开始返回
if __name__ == '__main__':#调试时使用
    # 创建对象Solution
    sol = Solution()
    # 定义l1链表
    l1 = ListNode(2)
    l1.next = l11 = ListNode(4)
    l11.next = l12 = ListNode(5)
    # 定义l2链表
    l2 = ListNode(5)
    l2.next = l21 = ListNode(6)
    l21.next = l22 = ListNode(4)
    # 获取返回值的链表
    res = sol.addTwoNumbers(l1, l2)
    # 循环遍历出来
    while res:
        print(res.val)
        res = res.next

代码2

class ListNode():
    def __init__(self, x):
        self.val = x
        self.next = None


class Solution():
    def AddTwoNumebers(self, l1, l2):
        dummy = ListNode(0)
        p = dummy
        carry = 0
        while l1 and l2:
            p.next = ListNode((l1.val + l2.val + carry) % 10)
            carry = (l1.val + l2.val + carry) // 10
            l1 = l1.next
            l2 = l2.next
            p = p.next
            '''
            p.next和carry计算完之后
            l1需指向下一节车厢
            l2也指向下一节车厢
            存放和的火车p也需指向下一节车厢
            '''

        while l1:
            p.next = ListNode((l1.val + carry) % 10)
            carry = (l1.val + carry) // 10
            l1 = l1.next
            p = p.next

        while l2:
            p.next = ListNode((l2.val + carry) % 10)
            carry = (l2.val + carry) // 10
            l2 = l2.next
            p = p.next

        if carry != 0:
            p.next = ListNode(1)
        return dummy.next


if __name__ == "__main__":
    l1 = ListNode(2)
    l1.next = ListNode(4)
    l1.next.next = ListNode(5)
    l2 = ListNode(5)
    l2.next = ListNode(6)
    # l2.next.next=ListNode(4)
    sol = Solution()
    res = sol.AddTwoNumebers(l1, l2)
    # 返回链表需要使用while循环，一次返回一个数值
    while res:
        print(res.val)
        res = res.next