Write the function called arrange that takes a list of integers (positive and negative) as an input parameter. The arrange function must use a deque data structure to arrange the integers so the negative numbers occur before the positive numbers (note that the function doesn't sort the values). The function returns a new list containing the rearranged elements. For instance, for the input list [-3, 12, 6, -7, -1, 8], the function would return [-1, -7, -3, 12, 6, 8]. Write the main function to test the arrange function using various inputs.
Write the function called arrange that takes a list of integers (positive and negative) as an input parameter. The arrange function must use a deque data structure to arrange the integers so the negative numbers occur before the positive numbers (note that the function doesn't sort the values). The function returns a new list containing the rearranged elements. For instance, for the input list [-3, 12, 6, -7, -1, 8], the function would return [-1, -7, -3, 12, 6, 8].
Write the main function to test the arrange function using various inputs.
dequeue.py file
class Deque:
def __init__(self):
self.items = []
def is_empty(self):
return self.items == []
def add_front(self, item):
self.items.append(item)
def add_rear(self, item):
self.items.insert(0,item)
def remove_front(self):
return self.items.pop()
def remove_rear(self):
return self.items.pop(0)
def size(self):
return len(self.items)
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
