class Node(object):
"""节点类"""
def __init__(self, item):
self.item = item # 第一个元素类/实例变量
self.next = None # 下一节点
class SingleNode(object):
"""单链表"""
def __init__(self, node=None):
self.__head = node
def is_empty(self):
"""链表是否为空"""
return self.__head is None
def length(self):
"""链表长度"""
cur = self.__head
count = 0
while cur is not None:
count += 1
cur = cur.next
return count
def tarver(self):
"""遍历整个链表"""
cur = self.__head
while cur is not None:
print(cur.item, end=" ")
cur = cur.next
print()
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 is not None:
cur = cur.next
# 退出循环的时候,cur指向尾节点
cur.next = node
def insert(self, pos, item):
"""指定位置添加"""
node = Node(item)
if pos <= 0:
self.add(item)
elif pos > self.length():
self.append(item)
else:
count = 0
cur = self.__head
while count < (pos - 1):
count += 1
cur = cur.next
node.next = cur.next
cur.next = node
def remove(self, item):
"""删除节点"""
cur = self.__head
pre = None
while cur != None:
if cur.item == item:
if not pre:
self.__head = cur.next
else:
pre.next = cur.next
break
else:
cur += cur.next
pre = cur
def search(self, item):
"""链表查找节点是否存在,并返回True或者False"""
cur = self.__head
while cur != None:
if cur.item == item:
return True
cur = cur.next
return False
if __name__ == '__main__':
ll = SingleNode()
ll.add(1)
ll.tarver()
ll.add(2)
ll.tarver()
ll.append(3)
ll.tarver()
ll.insert(2, 4)
ll.tarver()
ll.remove(2)
ll.tarver()
结果: