Question

Need help the first picture is the code I have so far the second are the requirements. It’s a deque array in python

class dequeArray: DEFAULT-CAPACITY 10 #moderate capacity for all new queues def init (self): self.capacity-5 capacity self.capacity self.data self, make array(self. capacity) self. size self. front-θ def len (self): return self. size def _getiten-(self, k); #Return element at index k if not θ k < self. size: raise IndexError('invalid index) return self._data[k] def isEmpty(self): if self. data0: return False else: return True def append(self, item): #add an element to the back of the queue if self. size self.capacity: self. data.pop(8) else: avail-(self-front + self.-size) self. data[avail] item self. size1 % len(self, data) def make array(self, c): capacity self, capacity turn (capacity ctypes.py object) def removeFirst(self): if self. size self.capacity: self. data.pop(8) else: answer self. data[self. _front] self. data[self. front] - None self-front-(self.-front + 1)、len(self.data) self. size 1 print(answer)

Answer 1

import ctypes

class DequeArray:

def __init__(self):

self.capacity = 5

capacity = self.capacity

self._data = self._make_array(self.capacity)

self._size = 0

self._front = 0

def _make_array(self, c):

capacity = self.capacity

return(capacity*ctypes.py_object)()

def isEmpty(self) :

if self._data == 00:

return False

else:

return True

def __len__(self):

return self._size

def __getitem__(self, index): #return element at index k

if not 0 <= index <self._size:

raise IndexError('invalid index')

return self._data[index]

def __setitem__(self, index, value):

if not 0 <= index <self._size:

raise IndexError('invalid index')

self._data[index] = value

def append(self, item):

if self._size == self.capacity:

self._data.pop(0)

else:

avail = (self._front + self._size)% len(self._data)

self._data[avail] = item

self._size += 1

def preappend(self, item): # update front index after preappend

for index in range(self._size()):

index+=1

self._front = 0

self._size = index

self.insert(self._front,value)

def removeFirst(self): #update index after removal

if self._size == self.capacity:

self._data.pop(0)

else:

answer = self._data[self._front]

self._data[self._front] = None

self._front = (self._front + 1)%len(self._data)

self._size -= 1

return answer

def removeLast(self):

if self._size == self.capacity:

self._data.pop(0)

else:

value = self._data[self._size]

self._data[self._size] = None

self._size -= 1

return value

def insert(self, index, item):

if self._size == self.capacity:

self._data.pop(self._data[self._size])

temp = index

for index in (index, self._size()):

index+=1

self.__setitem__(temp, item)

# def remove(self, index, item):

# def print(self):

d = DequeArray()

print(d.isEmpty())

d.insert(1,10)

d.append(2)

d.preappend(3)

print(d.__len__())

print(d.__getitem__(1)) # return element at index k

d.__setitem__(2,5) # set value 5 at index 2

print(d.removeFirst())

print(d.removeLast())

print(d.remove(0)) #Remove and return the item at the index, and shift the subsequent items

print(d.print())