"""
给定两个单链表,链表的每个结点代表一位数,计算两个数的和。例如:输入链表(3->1->5)和链表(5->9->2),输出:8->0->8,即513+295=808,注意个位数在链表头
"""
class LNode:
def __init__(self):
self.data = None
self.next = None
def add(h1, h2):
"""
方法功能:对于两个带头结点的单链表所代表的数相加
输入参数:h1:第一个链表头结点, h2:第二个链表头结点
"""
if h1 is None or h1.next is None:
return
if h2 is None or h2.next is None:
return
c = 0 # 用来记录进位
sums = 0 # 用来记录两个结点相加的值
p1 = h1.next # 用来遍历h1
p2 = h2.next # 用来遍历h2
tmp = None # 用来指向新创新的存储相加和的结点
resultHead = LNode() # 相加后链表头结点
p = resultHead # 用来指向链表resultHead最后一个结点
while p1 is not None and p2 is not None:
tmp = LNode()
sums = p1.data + p2.data + c
tmp.data = sums % 10 # 两个结点相加和
c = sums // 10 # 进位
p.next = tmp
p = tmp
p1 = p1.next
p2 = p2.next
# 链表h2比h1长,接下来只需要考虑h2剩余结点的值
if p1 is None:
while p2 is not None:
tmp = LNode()
sums = p2.data + c
tmp.data = sums % 10
c = sums // 10
p.next = tmp
p = tmp
p2 = p2.next
# 链表h1比h2长,接下来只需要考虑h1剩余结点的值
if p2 is None:
while p1 is not None:
tmp = LNode()
sums = p1.data + c
tmp.data = sums % 10
c = sums // 10
p.next = tmp
p = tmp
p1 = p1.next
# 如果计算完成后还有进位, 则增加新的结点
if c == 1:
tmp = LNode()
tmp.data = 1
p.next = tmp
return resultHead
if __name__ == '__main__':
i = 1
head1 = LNode()
head2 = LNode()
tmp = None
cur = head1
addResult = None
# 构造第一个链表
while i < 7:
tmp = LNode()
tmp.data = i + 2
cur.next = tmp
cur = tmp
i += 1
cur = head2
# 构造第二个链表
i = 9
while i > 4:
tmp = LNode()
tmp.data = i
cur.next = tmp
cur = tmp
i -= 1
print('\nHead1:')
cur = head1.next
while cur is not None:
print(cur.data, end=' ')
cur = cur.next
print('\nHead2:')
cur = head2.next
while cur is not None:
print(cur.data, end=' ')
cur = cur.next
addResult = add(head1, head2)
print('\n相加后:')
cur = addResult.next
while cur is not None:
print(cur.data, end=' ')
cur = cur.next
运行结果如下:
Head1:
3 4 5 6 7 8
Head2:
9 8 7 6 5
相加后:
2 3 3 3 3 9