# 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
"""
res = ListNode(None)
res.next = None
ptr = res
carry = 0
ptr1 = l1
ptr2 = l2
while ptr1 or ptr2 or carry != 0:
if ptr1:
val1 = ptr1.val
ptr1 = ptr1.next
else:
val1 = 0
if ptr2:
val2 = ptr2.val
ptr2 = ptr2.next
else:
val2 = 0
val = val1 + val2 + carry
ptr_n = ListNode(val%10)
carry = int(val/10)
ptr.next = ptr_n
ptr = ptr_n
ptr.next = None
return res.next
Python, LeetCode, 2. 两数相加
最新推荐文章于 2024-07-21 13:45:38 发布