# 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
"""
i = l1
j = l2
partial = i.val + j.val
l3 = ListNode(partial%10)
k = l3
i = i.next
j = j.next
while (i is not None or j is not None):
if partial >= 10:
abort = 1
else:
abort = 0
if i is not None and j is not None:
partial = i.val + j.val + abort
i = i.next
j = j.next
elif i is not None:
partial = i.val + abort
i = i.next
else:
partial = j.val + abort
j = j.next
k.next = ListNode(partial%10)
k = k.next
if partial >= 10:
k.next = ListNode(1)
k = k.next
return l3
LeetCode 002 两数相加
最新推荐文章于 2022-04-13 11:00:06 发布