JZ76 删除链表中重复的结点

最新推荐文章于 2023-07-26 19:56:22 发布

自律信仰

最新推荐文章于 2023-07-26 19:56:22 发布

阅读量81

点赞数

分类专栏：剑指 # 算法文章标签：链表数据结构

本文链接：https://blog.csdn.net/hza163/article/details/128738250

版权

算法同时被 2 个专栏收录

115 篇文章 0 订阅

订阅专栏

剑指

28 篇文章 0 订阅

订阅专栏

该代码实现了一个Python类Solution，方法deleteDuplication用于删除链表中相邻且相等的节点。首先创建一个虚拟头节点，然后遍历链表，当遇到相邻节点不等时正常移动，相等时则删除所有连续的重复节点。最后返回新链表的头节点。

摘要由CSDN通过智能技术生成

在这里插入图片描述

我的代码：

class Solution:
    def deleteDuplication(self, pHead: ListNode) -> ListNode:
        head = ListNode(-1)
        tail = head
        while pHead:
            if not pHead.next:  # 最后一个结点
                tail.next = pHead
                tail = tail.next
                pHead = pHead.next
            elif pHead.val != pHead.next.val:  # 非最后一个结点且相邻不等
                tail.next = pHead
                tail = tail.next
                pHead = pHead.next
            else:  # 非最后一个结点且相邻相等
                val = pHead.val # 所有值val的结点都该删除
                while pHead and pHead.val == val:# 慢慢删除值相等的结点
                    pHead = pHead.next
        tail.next = None
        return head.next

完整代码：
MyList.py

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

    def show(self):
        p = self
        while p is not None:
            print(p.val, end=' ')
            p = p.next
        print()


# 只返回头节点
def Create(data):
    # print('data',data)
    if len(data) < 1:
        return None

    head = ListNode(data[0])
    tail = head
    for i in range(1, len(data)):
        tail.next = ListNode(data[i])
        tail = tail.next
    return head

JZ76.py

from myutils.MyList import *


class Solution:
    def deleteDuplication(self, pHead: ListNode) -> ListNode:
        head = ListNode(-1)
        tail = head
        while pHead:
            if not pHead.next:  # 最后一个结点
                tail.next = pHead
                tail = tail.next
                pHead = pHead.next
            elif pHead.val != pHead.next.val:  # 非最后一个结点且相邻不等
                tail.next = pHead
                tail = tail.next
                pHead = pHead.next
            else:  # 非最后一个结点且相邻相等
                val = pHead.val # 所有值val的结点都该删除
                while pHead and pHead.val == val:# 慢慢删除值相等的结点
                    pHead = pHead.next
        tail.next = None
        return head.next


if __name__ == '__main__':
    pHead = Create([1, 2, 3, 3, 4, 4, 5])
    pHead.show()
    ans = Solution().deleteDuplication(pHead)
    ans.show()