文章目录
Python数据结构与算法(三)
一、链表的提出
(1)为什么需要链表
(2)链表的定义
二、单链表的ADT模型
(一)单向链表
(二)节点实现
(二)单链表的操作
三、Python中变量标识的本质
四、单链表及结点的定义代码
# coding:utf-8
class Node(object):
'''节点'''
def __init__(self,elem):
self.elem = elem
self.next = None
# node = Node(100)
class SingleLinkList(object):
"""单链表"""
def __init__(self,node=None):
self._head = node
def is_empty(self):
"""链表是否为空"""
pass
def length(self):
"""链表长度"""
pass
def travel(self):
"""遍历整个链表"""
pass
def add(self,item):
"""链表头部添加元素"""
pass
def append(self,item):
"""链表尾部添加元素"""
pass
def insert(self,pos,item):
"""指定位置添加元素"""
pass
def remove(self,item):
"""删除节点"""
pass
def search(self,item):
"""查找节点是否存在"""
pass
五、单链表的判空、长度、遍历与尾部添加结点的代码实现
头插法示意图
六、单链表尾部添加和在指定位置添加
在尾部插入结点示意图
在指定位置添加结点
七、单链表查找和删除元素
删除元素示意图
代码:
# coding:utf-8
class Node(object):
'''节点'''
def __init__(self,elem):
self.elem = elem
self.next = None
# node = Node(100)
class SingleLinkList(object):
"""单链表"""
def __init__(self,node=None):
self.__head = node #__head是私有变量
def is_empty(self):
"""链表是否为空"""
return self.__head == None
def length(self):
"""链表长度"""
# cur游标等于起始节点,用来移动遍历节点
cur = self.__head
# count记录数量
count = 0
while cur != None:
count += 1
cur = cur.next
return count
def travel(self):
"""遍历整个链表"""
cur = self.__head
while cur != 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 != None:
cur = cur.next
cur.next = node
def insert(self,pos,item):
"""指定位置添加元素
:param pos 从0开始
"""
if pos <= 0:
self.add(item)
elif pos > (self.length() - 1):
self.append(item)
else:
pre = self.__head
count = 0
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 #cur从头结点开始
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)
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)
#8 1 2 3 4 5 6
ll.insert(-1,9) #9 8 1 2 3 4 5 6
ll.travel()
ll.insert(3,100) # 9 8 1 100 2 3 4 5 6
ll.travel()
ll.insert(10,200) #9 8 1 100 2 3 4 5 6 200
ll.travel()
ll.remove(100)
ll.travel()
ll.remove(9)
ll.travel()
ll.remove(200)
ll.travel()
运行结果:
八、单链表与顺序表的对比
九、双向链表及添加元素
(一)概念
(二)操作
在头结点插入结点
在尾部插入结点
在固定位置插入结点
十、双向链表删除元素
删除元素
代码:
# coding:utf-8
class Node(object):
"""结点"""
def __init__(self,item):
self.elem = item
self.next = None
self.prev = None
class DoubleLinkList(object):
"""双链表"""
def __init__(self,node=None):
self.__head = node #__head是私有变量
def is_empty(self):
"""链表是否为空"""
return self.__head is None
def length(self):
"""链表长度"""
# cur游标等于起始节点,用来移动遍历节点
cur = self.__head
# count记录数量
count = 0
while cur != None:
count += 1
cur = cur.next
return count
def travel(self):
"""遍历整个链表"""
cur = self.__head
while cur != None:
print(cur.elem, end = " ")
cur = cur.next
print("")
def add(self,item):
"""链表头部添加元素,头插法"""
node = Node(item)
node.next = self.__head
self.__head = node
node.next.prev = 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 insert(self,pos,item):
"""指定位置添加元素
:param pos 从0开始
"""
if pos <= 0:
self.add(item)
elif pos > (self.length() - 1):
self.append(item)
else:
cur = self.__head
count = 0
while count < pos:
count += 1
cur = cur.next
#当循环退出后,pre指向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 #cur从头结点开始
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)
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)
# 8 1 2 3 4 5 6
ll.insert(-1, 9) # 9 8 1 2 3 4 5 6
ll.travel()
ll.insert(3, 100) # 9 8 1 100 2 3 4 5 6
ll.travel()
ll.insert(10, 200) # 9 8 1 100 2 3 4 5 6 200
ll.travel()
ll.remove(100)
ll.travel()
ll.remove(9)
ll.travel()
ll.remove(200)
ll.travel()
十一、单向循环链表遍历和求长度
(一)概念
(二)操作
求循环单链表长度:
循环单链表的遍历
十二、单向循环链表添加元素
循环单链表头部插入元素
尾插法的两种方式
在任意位置插入和单链表相同
十三、单向循环链表查找元素
# coding:utf-8
class Node(object):
'''节点'''
def __init__(self,elem):
self.elem = elem
self.next = None
# node = Node(100)
class SingleLinkList(object):
"""单向循环链表"""
def __init__(self,node=None):
self.__head = node #__head是私有变量
if node:
node.next = node
def is_empty(self):
"""链表是否为空"""
return self.__head == None
def length(self):
"""链表长度"""
if self.is_empty():
return 0
# cur游标等于起始节点,用来移动遍历节点
cur = self.__head
# count记录数量
count = 1
while cur.next != self.__head:
count += 1
cur = cur.next
return count
def travel(self):
"""遍历整个链表"""
if self.is_empty():
return
cur = self.__head
while cur.next !=self.__head:
print(cur.elem, end = " ")
cur = cur.next
# 退出循环,cur指向尾结点,但尾结点的元素未打印
print(cur.elem)
def add(self,item):
"""链表头部添加元素,头插法"""
node = Node(item)
if self.is_empty():
self.__head = node
node.next = node
else:
cur = self.__head
while cur.next != self.__head:
cur = cur.next
# 退出循环,cur指向尾结点
node.next = self.__head
self.__head = node
#cur.next = node
cur.next = self.__head
def append(self,item):
"""链表尾部添加元素,尾插法"""
node = Node(item)
if self.is_empty():
self.__head = node
node.next = node
else:
cur = self.__head #游标指向第一个结点
while cur.next != self.__head:
cur = cur.next
#node.next = cur.next
node.next = self.__head
cur.next = node
def insert(self,pos,item):
"""指定位置添加元素
:param pos 从0开始
"""
if pos <= 0:
self.add(item)
elif pos > (self.length() - 1):
self.append(item)
else:
pre = self.__head
count = 0
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):
"""删除节点"""
if self.is_empty():
return
cur = self.__head #cur从头结点开始
pre = None
while cur.next != self.__head:
if cur.elem == item:
#先判断此结点是否是头结点
if cur == self.__head:
# 头结点的情况
#找尾结点
rear = self.__head
while rear.next != self.__head:
rear = rear.next
self.__head = cur.next
rear.next = self.__head
else:
#中间结点
pre.next = cur.next
return
else:
pre = cur
cur = cur.next
#退出循环,cur指向尾结点
if cur.elem == item:
if cur == self.__head:
# 链表只有一个节点
self.__head = None
else:
pre.next = cur.next
def search(self,item):
"""查找节点是否存在"""
if self.is_empty():
return False
cur = self.__head
while cur.next != self.__head:
if cur.elem == item:
return True
else:
cur = cur.next
# 退出循环,cur指向尾结点
if cur.elem == item:
return True
return False
if __name__ == "__main__":
ll = SingleLinkList()
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)
#8 1 2 3 4 5 6
ll.insert(-1,9) #9 8 1 2 3 4 5 6
ll.travel()
ll.insert(3,100) # 9 8 1 100 2 3 4 5 6
ll.travel()
ll.insert(10,200) #9 8 1 100 2 3 4 5 6 200
ll.travel()
ll.remove(100)
ll.travel()
ll.remove(9)
ll.travel()
ll.remove(200)
ll.travel()
运行结果