一、单链表概念:
1、链表:由一组被称为节点的数据元素组成的数据结构;
2、结点包含两部分信息:一部分用于存储数据元素的值,称为信息域;另一部 分用于存储下一个数据元素地址的指针,称为指针域;
二、单向链表的操作:
(一)、判断链表是否为空:
(二)、求链表长度:
(三)、遍历链表:
(四)、在尾部添加元素:
(五)、在头部添加元素:
(六)、插入元素:
(七)、查找元素是否存在:
(八)、删除元素:
代码实现:
#节点类:
class Node:
def init(self,elem):
self.elem=elem
self.next=None
class SingleLinkList:
def init(self,node=None)
self.__head=node
def is_empty(self):
return self.__head==None
def length(self):
count=0
cur=self.__head
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 append(self,item):
node = Node(item)
if self.__head == None:
self.__head = node
else:
cur = self.__head
while cur.next != None :
cur = cur.next
cur.next = node
在头部添加元素
def add(self,item):
node = Node(item)
node.next = self.__head
self.__head = node
插入元素
def insert(self,pos,item):
if pos <= 0:
self.add(item)
elif pos > self.length()-1:
self.append(item)
else:
node = Node(item)
cur = self.__head
count = 0
while count < pos - 1 :
count += 1
cur = cur.next
node.next = cur.next
cur.next = node
查找元素是否存在
def search(self,item):
cur = self.__head
while cur != None:
if cur.elem == item:
return True
else:
cur = cur.next
return False
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