Question

Priority Queue Using A List in Python

I would like to pass in a list to this class and modify the list using these functions only. Use a list of size 10 and use each of the functions with that list.

class PQ_List(object): def __init__(self, sampleList): print ("creates an unsorted list from passed in list") # # Returns the list    def enQueue(self, item): print ("adds an item to the PQ") # Add an item to the PQ    def deQueue(self): print ("removes the highest priority item from the PQ") # Remove the highest priority item from the PQ    def sneakAPeek(self): print ("returns the highest priority in the PQ, but does not remove it") # # Return the highest priority item from the PQ, but don't remove it def isEmpty(self): print ("returns T if PQ is empty, F if PQ has entries")    # Return a T if PQ is empty, F if PQ is not empty #    def size(self): print ("returns number of items in queue") # Return the number of items in the queue

Answer 1

class PQ_List(object):
   def __init__(self, sampleList):
       self.list = sampleList
       print ("creates an unsorted list from passed in list")
   # Returns the list

   def enQueue(self, item):
       self.list.append(item)
       print ("adds an item to the PQ")
       print (self.list)

   # Add an item to the PQ

   def deQueue(self):
       self.list = self.list[1:]
       print ("removes the highest priority item from the PQ")
       print(self.list)
       # Remove the highest priority item from the PQ

   def sneakAPeek(self):
       print ("returns the highest priority in the PQ, but does not remove it")
       return self.list[0]
       # Return the highest priority item from the PQ, but don't remove it

   def isEmpty(self):
       print ("returns T if PQ is empty, F if PQ has entries")
       if len(self.list) > 0:
           return 'F'
       else:
           return 'T'
       # Return a T if PQ is empty, F if PQ is not empty

   def size(self):
       print ("returns number of items in queue")
       return len(self.list)
       # Return the number of items in the queue