链表

最新推荐文章于 2024-12-01 18:04:09 发布

进击的rookie of python

最新推荐文章于 2024-12-01 18:04:09 发布

阅读量250

点赞数 1

CC 4.0 BY-SA版权

分类专栏：训练文章标签：链表

本文链接：https://blog.youkuaiyun.com/rookie_is_me/article/details/89189488

训练专栏收录该内容

5 篇文章

订阅专栏

本文深入探讨了单链表的基本操作实现，包括初始化、判断空链表、获取链表长度、添加元素、追加元素、插入元素、删除元素、查找元素和获取元素位置等关键功能。通过具体代码示例，详细解析了每种操作的执行流程，为读者提供了一个清晰的单链表操作指南。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

单链

class Node:
    def __init__(self,item=None):
        self.item=item
        self.next=None
class SingleLink:
    def __init__(self):
        self.head=None
    def is_empty(self):
        return self.head==None
    def length(self):
        current=self.head
        count=0
        if current !=None:
            count+=1
            current=current.next
        return count
    def add(self,item):
        node = Node(item)
        node.next=self.head
        self.head=node
    def append(self,item):
        node=Node(item)
        if self.is_empty():
            self.head = node
        else:
            #将指针指向最后一个元素
            current=self.head
            while current.next!=None:
                current=current.next
            current.next=node
    def insert(self,pos,item):
        if pos<=0:
            self.add(item)
        elif pos>self.length()-1:
            self.append(item)
        else:
            node = Node(item)
            per = self.head
            count=0
            while count<pos-1:
                count+=1
                per=per.next
            node.next=per.next
            per.next=node

    def remove(self,item):
        current=self.head
        per=None
        while current != None:
            if current.item==item:
                if current == self.head:
                    self.head=current.next
                else:
                    per.next=current.next
                break
            else:
                per = current
                current=current.next

    def seach(self,item):
        current = self.head
        flag=False
        while not flag and current !=None:
            if current.item==item:
                flag=True
            else:
                current = current.next
        return flag

    def index(self,item):
        current = self.head
        index=0
        while current !=None:
            if current.item==item:
                return index
            else:
                index+=1
                current=current.next
        return -1

if __name__=="__main__":
    sl=SingleLink()
    sl.append(1)
    print(sl.is_empty())
    print(sl.seach(1))
    sl.append(2)
    print(sl.index(3))

链表

单链

循环单链