```python
class Node(object):
def __init__(self, data):
'''
data:数据
next:指向下一个节点
'''
self.data = data
self.next = None
class Single_LinkList(object):
def __init__(self, node=None):
'''
可以创建一个空链表,也可以创建一个带有节点的链表
'''
self.__head = node
def is_empty(self):
'''
链表是否为空
'''
if self.__head is None:
return True
else:
return False
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.data, end=' ')
cur = cur.next
def add(self, data):
'''
链表头添加元素,分两种情况,为空,不为空,以下都适用
'''
newnode = Node(data)
newnode.next = self.__head
self.__head = newnode
def append(self, data):
'''
链表尾添加元素,同样,分为空不为空
'''
newnode = Node(data)
# 1 为空
# 2 非空情况下先遍历找到最后一个节点,将最后一个节点的next指向新节点
if self.is_empty():
self.__head = newnode
else:
cur = self.__head
while cur.next is not None:
cur = cur.next
cur.next = newnode
def insert(self, pos, data):
'''
指定位置添加元素
插入位置可能有3种情况,头,尾,中间,也可能输入位置<0或者>length()
'''
if pos < 0 or pos > self.length():
print('索引位置越界')
elif pos == 0:
self.add(data)
elif pos == self.length():
self.append(data)
else:
newnode = Node(data)
index = 0 # 下标
cur = self.__head
while index < pos - 1:
index += 1
cur = cur.next
cur.next = newnode # pos前一个位置的next指向新节点
newnode.next = cur.next # 新节点的next指向pos位置上的节点
def remove(self, data):
'''
可能的情况:
1 空表 2 未找到 3 单节点链表 4 头部 5 尾部 6 中间
'''
cur = self.__head # 定义游标,指向当前位置
pre = None # 定义游标,指向上一个节点位置
while cur is not None:
if cur.data == data:
if cur == self.__head:
self.__head = cur.next
else:
pre.next = cur.next
break
else: # 向后移动
pre = cur
cur = cur.next
return False
def remove_n(self, n):
'''
删除链表倒数第n个节点
空链表 单个节点的链表 头节点 尾节点
'''
link_len = self.length()
if link_len == 0 or n > link_len or n <= 0:
return False
if link_len == n == 1:
self.__head = None
return True
if link_len == n:
self.__head = self.__head.next
return True
if n == 1:
cur = self.__head
while cur.next.next:
cur = cur.next
cur.next = None
return True
cur = self.__head
count = 1
while count < (link_len - n):
cur = cur.next
count += 1
cur.next = cur.next.next
def search(self, data):
'''
查找指定数据,成功返回下标,失败返回-1
'''
index = 0
cur = self.__head
while cur is not None:
if cur.data == data:
return index
index += 1
cur = cur.next
return -1
def index(self, pos):
'''
获取指定位置上的数据
'''
index = 0
cur = self.__head
while cur is not None: # 同样适用于空链表
if pos != index:
cur = cur.next
index += 1
else:
return cur.data
return None # 如果pos超出范围,返回None
if __name__ == '__main__':
l1 = Single_LinkList(node=Node(1))
l1.append(2)
l1.append(3)
l1.travel()
l1.remove_n(3)
l1.travel()
以上是自己之前写的一些单链表的操作,有不足的下面可以指出来哈