简单链表的实现
# coding:utf-8
class LinkedListNode(object):
'''链表节点类'''
def __init__(self, value):
# 存储值的地方
self.value = value
# 存储下一节点指针(位置)
self.pointer = None
class LinkedList(object):
'''链表实现类(单链表)'''
def __init__(self):
# 头节点
self.__head = None
def is_empty(self):
"""判断单链表是否为空"""
return self.__head == None
def length(self):
"""链表长度"""
# cur初始时指向头结点
cur = self.__head
count = 0
# 尾结点指向为None
while cur != None:
count += 1
cur = cur.pointer
return count
def travel(self):
"""遍历整个链表"""
cur = self.__head
while cur != None:
print(cur.value, end=" ")
cur = cur.pointer
print("")
def add(self, item):
"""链表头部添加元素"""
node = LinkedListNode(item)
node.pointer = self.__head
self.__head = node
def append(self, item):
"""链表尾部添加元素"""
node = LinkedListNode(item)
if self.is_empty():
self.__head = node
else:
cur = self.__head
while cur.pointer != None:
cur = cur.pointer
cur.pointer = node
def insert(self, pos, item):
"""指定位置添加元素"""
if pos <= 0:
self.add(item)
elif pos > (self.length() - 1):
self.append(item)
else:
node = LinkedListNode(item)
count = 0
pre = self.__head
while count < (pos - 1):
count += 1
pre = pre.pointer
node.pointer = pre.pointer
pre.pointer = node
def remove(self, item):
"""删除节点"""
cur = self.__head
pre = None
while cur != None:
if cur.value == item:
if not pre:
self.__head = cur.pointer
else:
pre.pointer = cur.pointer
break
else:
pre = cur
cur = cur.pointer
def search(self, item):
"""查找节点是否存在"""
cur = self.__head
while cur != None:
if cur.value == item:
return True
cur = cur.pointer
return False
if __name__ == "__main__":
ll = LinkedList()
ll.add(1)
ll.add(2)
ll.append(3)
ll.travel()
ll.insert(2, 4)
print("length:", ll.length())
ll.travel()
print(ll.search(3))
print(ll.search(5))
ll.remove(1)
print("length:", ll.length())
ll.travel()