单向链表
单向链表也叫单链表,是链表中最简单的一种形式,它的每个节点包含两个域,一个信息域(元素域)和一个链接域。这个链接指向链表中的下一个节点,而最后一个节点的链接域则指向一个空值。
- 表元素域elem用来存放具体的数据。
- 链接域next用来存放下一个节点的位置(python中的标识)
- 变量p指向链表的头节点(首节点)的位置,从p出发能找到表中的任意节点。
Python实现
# coding:utf-8
class Node(object):
"""节点"""
def __init__(self, elem):
self.elem = elem
self.next = None
class SingeLinkList(object):
"""单链表"""
def __init__(self, node=None):
self.__head = node
def is_empty(self):
"""链表是否为空"""
return self.__head is None
def length(self):
"""链表长度"""
count = 0
cur = self.__head
while cur is not None:
count += 1
cur = cur.next
return count
def travel(self):
"""遍历整个链表"""
cur = self.__head
while cur is not None:
print(cur.elem, 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.next = node
def insert(self, pos, item):
"""指定位置添加元素"""
if pos <= 0:
self.add(item)
elif pos >= self.length():
self.append(item)
else:
pre = self.__head
count = 0
while count < (pos-1):
pre = pre.next
count += 1
# 结束while循环后,pre指向pos-1
node = Node(item)
node.next = pre.next
pre.next = node
def remove(self, item):
"""删除节点"""
pre = None
cur = self.__head
while cur is not None:
if cur.elem == item:
if cur == self.__head:
# 对于头节点
self.__head = cur.next
else:
# 对于中间节点
pre.next = cur.next
break
else:
pre = cur
cur = cur.next
def search(self, item):
"""查找节点是否存在"""
if self.is_empty():
return False
cur = self.__head
while cur is not None:
if cur.elem == item:
return True
else:
cur = cur.next
return False
# 测试
if __name__ == "__main__":
ll = SingeLinkList()
print(ll.is_empty())
print(ll.length())
ll.append(1)
print(ll.is_empty())
print(ll.length())
ll.append(2)
ll.add(8)
ll.append(3)
ll.append(4)
ll.append(5)
ll.append(6)
ll.travel()
# 8 1 2 3 4 5 6
ll.insert(-1, 9) # 9 8 1 2 3 4 5 6
ll.travel()
ll.insert(2, 100) # 9 8 100 1 2 3 4 5 6
ll.travel()
ll.insert(10, 200) # 9 8 100 1 2 3 4 5 6 200
ll.travel()
ll.remove(100)
ll.travel()
ll.remove(9)
ll.travel()
ll.remove(200)
ll.travel()