class myQueue(object):
def __init__(self,list= []):
self.__list = list
def size(self):
return len(self.__list)
def delete(self):
if self.size() == 0:
print("空队列,不能删除")
else:
temp_delete = self.__list[0]
del self.__list[0]
return temp_delete
def insert(self,data):
self.__list.append(data)
def peek(self):
if self.__size() == 0:
print("空队列")
else:
return self.__list[0]
- 2.优先级队列--------------医院排队
class myPQueue(object):
def __init__(self,list= []):
self.__list = list
def size(self):
return len(self.__list)
def delete(self):
if self.size() == 0:
print("空队列,不允许删除")
else:
temp_delete = self.__list[0]
del self.__list[0]
return temp_delete
def insert(self,data):
if self.size() == 0:
self.__list.append(data) #若队列为空,则数据直接插入
else:
temp = -1
for i in range(len(self.__list)):
if self.__list[i] > data:
temp = i
break
if temp == -1:
self.__list.append(data)
else:
self.__list.insert(temp,data)
def peek(self):
if self.size() == 0:
print("空队列")
else:
return self.__list[0]
q = myPQueue
q.insert(1)
q.insert(2)
q.insert(3)
q.insert(4)
q.insert(5)
print(q.delete())
print(q.delete())
print(q.delete())
print(q.delete())
print(q.delete())
#test0008
#双向链表----增删改查
class NullLinkedError(BaseException):
def __init_(self):
super().__init__("null linked error")
class node():
#content:创建节点,表示链表中元素,有三个属性
# pre-前驱结点地址
# data-数据
# next-后继节点地址
def __init__(self, data, pre=None, next=None):