Python实现链表
# coding:utf8
#节点类 class Node(): def __init__(self, _item): self.item = _item self.next = None #链表类 class Link(): def __init__(self): self._head = None def add(self, _item): node = Node(_item) node.next = self._head self._head = node def append(self, _item): node = Node(_item) cur = self._head pre = None # 链表为空,追加的为第一个节点时 if cur == None: self._head = node return while cur: pre = cur cur = cur.next pre.next = node def insert(self, pos, _item): node = Node(_item) pre = None cur = self._head for i in range(pos): pre = cur cur = cur.next pre.next = node node.next = cur def remove(self, _item): pre = None cur = self._head # 如果删除项为首部节点 if cur.item == _item: self._head = cur.next return while cur: pre = cur cur = cur.next if cur == None: return if cur.item == _item: pre.next = cur.next return def search(self, _item): flag = False cur = self._head while cur: if cur.item == _item: flag = True cur = cur.next return flag def travel(self): cur = self._head while cur: print(cur.item) cur = cur.next def isEmpty(self): return self._head == Node def size(self): cur = self._head count = 0 while cur: count += 1 cur = cur.next return count if __name__ == "__main__": link = Link() link.add(1) link.add(2) link.add(3) link.append(4) link.append(5) link.insert(1, 7) link.travel() link.remove(5) link.travel() print(link.isEmpty()) print(link.size()) print(link.search(5)) print(link.search(6))
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 从 HTTP 原因短语缺失研究 HTTP/2 和 HTTP/3 的设计差异
· AI与.NET技术实操系列:向量存储与相似性搜索在 .NET 中的实现
· 基于Microsoft.Extensions.AI核心库实现RAG应用
· Linux系列:如何用heaptrack跟踪.NET程序的非托管内存泄露
· 开发者必知的日志记录最佳实践
· TypeScript + Deepseek 打造卜卦网站:技术与玄学的结合
· Manus的开源复刻OpenManus初探
· AI 智能体引爆开源社区「GitHub 热点速览」
· 从HTTP原因短语缺失研究HTTP/2和HTTP/3的设计差异
· 三行代码完成国际化适配,妙~啊~