链表基本问题

最新推荐文章于 2025-12-04 09:26:59 发布

原创最新推荐文章于 2025-12-04 09:26:59 发布 · 116 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#链表 #数据结构

算法与数据结构专栏收录该内容

23 篇文章

订阅专栏

这篇博客介绍了如何实现单链表和双链表的反转，以及如何从链表中删除给定值的所有节点。通过定义Node类并提供相应的反转和删除方法，实现了对链表数据结构的基本操作。

1.单链表和双链表的反转

class Link():
    # 单链表和双链表的反转
    def node(self, value):
        self.value = value
        self.next = None

    def doublenode(self, value):
        self.value = value
        self.last = None
        self.next = None

    def nodereverse(self, head):
        pre = None
        next = None
        while head != None:
            next = head.next
            head.next = pre
            pre = head
            head = next
        return pre
    
    def doublenodereverse(self, head):
        pre = None
        next = None
        while head != None:
            next = head.next
            head.next = pre
            head.last = next
            pre = head
            head = next
        return pre

2.把给定的值都删除

class Linkremove():
    def node(self, value):
        self.value = value
        self.next = None

    def linkremove(self, head, num):
        while head != None:
            if head.value != num:
                break
            head = head.next
        # head 来到第一个不需要删除的位置
        pre = head
        cur = head
        while cur != None:
            if cur.value == num:
                pre.next = cur.next
            else:
                pre = cur
            cur = cur.next
        return head