单链表的操作
- is_empty() 链表是否为空
- length() 链表长度
- travel() 遍历整个链表
- add(item) 链表头部添加元素
- append(item) 链表尾部添加元素
- insert(pos, item) 指定位置添加元素
- remove(item) 删除节点
- search(item) 查找节点是否存在
代码实现:
# coding=utf-8
class Node(object):
"""节点"""
def __init__(self,elem):
#elem存放数据元素
self.elem = elem
#next是下一个节点的标识
self.next = None
class Singlelinklist(object):
"""单链表"""
def __init__(self,node=None):
#node(item),有实参之后就不是None
self.__head = node
def Is_empty(self):
"""链表是否为空"""
return self.__head==None
def length(self):
"""链表长度"""
# cur 游标,用来移动遍历节点
cur = self.__head
# 记录数量
count = 0
# 判断节点是否为空
while cur != None:
count += 1
cur = cur.next
return count
def trave(self):
"""遍历整个链表"""
cur = self.__head
while cur!=None:
print(cur.elem,end=' ')
cur = cur.next
print()
def add(self,item):
"""链表头部添加元素"""
node = Node(item)
#与head一样指向第一个节点,不是赋值
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 indert(self,pos,item):
"""指定位置添加元素"""
#不是pre指向self.__head,也让pre与self.__head指向同一个地址
pre = self.__head
count = 0
if pos<0:
self.add(item)
elif pos>self.length():
self.append(item)
else:
while count<(pos-1):
count += 1
pre = pre.next
#当循环退出后,pre指向pos-1位置
node = Node(item)
node.next = pre.next
pre.next = node
def remove(self,item):
"""删除节点"""
cur = self.__head
pre = None
while cur!=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):
"""查找节点是否存在"""
cur = self.__head
while cur!=None:
if cur.elem==item:
return True
else:
cur = cur.next
return False
# 测试模块
if __name__ == "__main__":
ll = Singlelinklist()
print(ll.Is_empty())
print(ll.length())
ll.append(1)
ll.append(4)
print(ll.Is_empty())
print(ll.length())
ll.append(2)
ll.append(4)
ll.append(6)
ll.append(8)
ll.add(21)
ll.indert(-1,9)
ll.indert(10, 28)
ll.indert(1, 88)
ll.trave()
ll.remove(9)
ll.trave()
输出结果:
True
0
False
2
9 88 21 1 4 2 4 6 8 28
88 21 1 4 2 4 6 8 28
双向链表操作
- is_empty() 链表是否为空
- length() 链表长度
- travel() 遍历链表
- add(item) 链表头部添加
- append(item) 链表尾部添加
- insert(pos, item) 指定位置添加
- remove(item) 删除节点
- search(item) 查找节点是否存在
代码实现:
#coding=utf-8
class Node(object):
def __init__(self,elem):
self.elem = elem
self.next = None
self.prev = None
class DoubleLinklist(object):
"""双链表"""
def __init__(self,node=None):
#node(item),有实参之后就不是None
self.__head = node
def Is_empty(self):
"""链表是否为空"""
return self.__head is None
def length(self):
"""链表长度"""
# cur 游标,用来移动遍历节点
cur = self.__head
# 记录数量
count = 0
# 判断节点是否为空
while cur != None:
count += 1
cur = cur.next
return count
def trave(self):
"""遍历整个链表"""
cur = self.__head
while cur!=None:
print(cur.elem,end=' ')
cur = cur.next
print()
def add(self,item):
"""链表头部添加元素"""
node = Node(item)
#与head一样指向第一个节点,不是赋值
node.next = self.__head
# 将_head的头节点的prev指向node
self.__head.prev = node
self.__head = node
# 将_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
node.prev = cur
def indert(self,pos,item):
"""指定位置添加元素"""
#不是pre指向self.__head,也让pre与self.__head指向同一个地址
count = 0
if pos<0:
self.add(item)
elif pos>self.length():
self.append(item)
else:
cur = self.__head
while count<pos:
count += 1
cur = cur.next
#当循环退出后,cur指向pos位置
node = Node(item)
node.next = cur
node.prev = cur.prev
cur.prev.next = node
cur.prev = node
def remove(self,item):
"""删除节点"""
cur = self.__head
while cur!=None:
if cur.elem==item:
#判断是否为头节点
if cur==self.__head:
self.__head = cur.next
if cur.next:
# 判断链表是否只有一个节点
cur.next.prev = None
else:
cur.prev.next = cur.next
if cur.next:
cur.next.prev = cur.prev
break
else:
cur = cur.next
def search(self,item):
"""查找节点是否存在"""
cur = self.__head
while cur!=None:
if cur.elem==item:
return True
else:
cur = cur.next
return False
# 测试模块
if __name__=="__main__":
ll = DoubleLinklist()
print(ll.Is_empty())
print(ll.length())
ll.append(1)
ll.append(4)
print(ll.Is_empty())
print(ll.length())
ll.append(2)
ll.append(4)
ll.append(6)
ll.append(8)
ll.add(21)
ll.indert(-1,9)
ll.indert(10, 28)
ll.indert(1, 88)
ll.trave()
ll.remove(9)
ll.trave()
输出结果:
True
0
False
2
9 88 21 1 4 2 4 6 8 28
88 21 1 4 2 4 6 8 28