题意我看了很久才理解,就是这个函数传入两个链表,需要我们将相加之后的结果储存在链表中,然后将链表返回。输入的链表比如上面的示例,2和5分别是两个链表的最低位。即从左到右是从低位到高位。
我的思路是将两个链表从对低位对齐,逐位相加,用C储存是否有进位的信息,如果两个链表的长度不等,再在判断是否有进位的同时将较长的链表的剩余位数加进l3链表中。
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
C = False # 储存是否进位信息
l3 = ListNode(None)
temp = l3
while l1 is not None and l2 is not None: # 首先将l1和l2相等长度部分相加
if C: # 如果低位有进位
s = l1.val + l2.val + 1
else: ## 没有进位
s = l1.val + l2.val
if s < 10:
temp.next = ListNode(s)
C = False
else:
temp.next = ListNode(s%10)
C = True
temp = temp.next
l1 = l1.next
l2 = l2.next
if l1 is None and l2 is None: ## 然后对l1或者l2的多出来的部分与进位相加
if C:
temp.next = ListNode(1)
temp = temp.next
C = False
elif l1 is None:
while l2 is not None:
if C: # 如果有进位
s = l2.val + 1
else:
s = l2.val
if s < 10:
temp.next = ListNode(s)
C = False
else:
temp.next = ListNode(s%10)
C = True
temp = temp.next
l2 = l2.next
else:
while l1 is not None:
if C: # 如果有进位
s = l1.val + 1
else:
s = l1.val
if s < 10:
temp.next = ListNode(s)
C = False
else:
temp.next = ListNode(s%10)
C = True
temp = temp.next
l1 = l1.next
if C:
temp.next = ListNode(1)
return l3.next
这种方法显然不是非常好,因为它的结果不咋地:
下面我拿别人的代码来学习一下:
# 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
"""
re = ListNode(0)
r=re
carry=0
while(l1 or l2):
x= l1.val if l1 else 0
y= l2.val if l2 else 0
s=carry+x+y
carry=s//10
r.next=ListNode(s%10)
r=r.next
if(l1!=None):l1=l1.next
if(l2!=None):l2=l2.next
if(carry>0):
r.next=ListNode(1)
return re.next
这段代码的思路其实与我的相反,我是一开始将两个链表的相同长度部分相加,多余的部分到后面单独判断,这样无疑给自己带来了不少的麻烦,这段代码在while里边的判断语句是or,直到两个链表全部到达尾部的时候才跳出来,而较短的链表高位都为None的时候就视为0.这里有几个地方很关键,比如:
x= l1.val if l1 else 0
y= l2.val if l2 else 0
s=carry+x+y
这两行代码,可能我自己写的时候会这么写:
if not l1: s = l2.val + carry
elif not l2: s = l1.val + caryy
else: s = l1.val + l2.val + carry
殊不知上面的写法比我的写法高效得多。
还有个地方:
carry=s//10
r.next=ListNode(s%10)
r=r.next
我自己写的话会这么写:
if s >= 10:
carry = 1
s = s%10
else:
carry = 0
r.next=ListNode(s)
r=r.next
这里我就想不通为什么它的比我的高效,而且是从32%提升到53.77%(速度优势),但是我那样写有优势,我可以将s = s % 10
换成s = s - 10
测试之后发现速度优势从32%提升到了82.77%.
来看看更加高效的算法:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
carry = False
l1.val += l2.val
if l1.val >= 10:
carry = True
l1.val -= 10
l3 = l1
l1_finished = False
while l2 and not l1_finished:
l2 = l2.next
if l1.next:
l1 = l1.next
l1.val += l2.val if l2 else 0
else:
l1.next = l2
l1_finished = True
if not l1.next and carry:
l1.next = ListNode(0)
l1 = l1.next
if l1:
if carry:
l1.val += 1
if l1.val >= 10:
carry = True
l1.val -= 10
else:
carry = False
while carry:
if not l1.next:
l1.next = ListNode(0)
l1 = l1.next
l1.val += 1
if l1.val >= 10:
carry = True
l1.val -= 10
else:
carry = False
return l3
这段代码更高效的一个原因是它把分类情况很杂,有可能减少了循环的次数,还有它将所有的%和//运算转化成了加法或者减法,这也提高了很多的时间效率。