class Node():
# 节点
def __init__(self, ele):
self.ele = ele
self.next = None
class SingleLinkList():
# 单链表
def __init__(self, node=None):
self._head = node
def is_empty(self):
# 判断是否为空
return self._head == None
def length(self):
# 计算长度
# 创建游标
cur = self._head
count = 0
while cur != None:
count += 1
cur = cur.next
return count
def travel(self):
# 遍历链表
cur = self._head
while cur != None:
print(cur.ele)
cur = cur.next
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:
cur = self._head
while cur.next != None:
cur = cur.next
cur.next = node
def insert(self, pos, item):
# 指定位置插入 pos 从0开始
node = Node(item)
if pos <= 0:
self.add(item)
elif pos > self.length() - 1:
self.append(item)
else:
cur = self._head
count = 0
while count <= pos - 1:
cur = cur.next
count += 1
node.next = cur.next
cur.next = node
def remove(self, item):
cur = self._head
pre = None
while cur != None:
if cur.ele == item:
# 先判断此节点是否是头结点
if cur == self._head:
self._head = cur.next
else:
pre.next = cur.next
else:
pre = cur
cur = cur.next
def search(self, item):
# 查找元素是否存在
cur = self._head
while cur != Node:
if cur.ele == item:
return True
else:
cur = cur.next
return False
if __name__ == '__main__':
ll = SingleLinkList()
print(ll.is_empty())
print(ll.length())
ll.append(1)
print(ll.is_empty())
print(ll.length())
ll.append(2)
ll.travel()
ll.insert(2, 3)
ll.travel()
python 单链表
最新推荐文章于 2022-09-09 17:13:42 发布