牛客——链表相加

最新推荐文章于 2023-08-26 13:07:25 发布

江小北

最新推荐文章于 2023-08-26 13:07:25 发布

阅读量132

点赞数

分类专栏：算法刷题笔记

本文链接：https://blog.csdn.net/FeNGQiHuALOVE/article/details/115515163

版权

链表反转相加节点操作数据结构

关键词由CSDN通过智能技术生成

算法刷题笔记专栏收录该内容

157 篇文章 0 订阅

订阅专栏

在这里插入图片描述

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

#
# 
# @param head1 ListNode类 
# @param head2 ListNode类 
# @return ListNode类
#
class Solution:
    def addInList(self , head1 , head2 ):
        # write code here
        p = self.reverseList(head1)
        q = self.reverseList(head2)
        head = self.addTwoNumbers(p, q)
        return self.reverseList(head)
        
    def reverseList(self, head):
        pre = None
        while head:
            next = head.next
            head.next = pre
            pre = head
            head = next
        return pre
        # 先反转链表，然后从后向前加，再反转链表

    def addTwoNumbers(self, l1, l2):
        res = ListNode(0);
        resTemp = res
        flag = 0
        nextSum = 0
        while l1 != None and l2 != None:
            if flag == 0:
                p = l1.val + l2.val
                res.val = p % 10
                nextSum = int(p / 10)
                flag += 1
            else:
                p = l1.val + l2.val + nextSum
                resTemp.next = ListNode(p%10)
                resTemp = resTemp.next
                nextSum = int(p / 10)
            l1 = l1.next
            l2 = l2.next
        while l1:
            p = l1.val + nextSum
            resTemp.next = ListNode(p%10)
            resTemp = resTemp.next
            nextSum = int(p / 10)
            l1 = l1.next
        while l2:
            p = l2.val + nextSum
            resTemp.next = ListNode(p%10)
            resTemp = resTemp.next
            nextSum = int(p / 10)
            l2 = l2.next
        if nextSum != 0:
            resTemp.next = ListNode(1)
        return res