Implement a queue using two stacks
Anoniem
class Queue: def __init__(self): self.s1 = [] self.s2 = [] def enqueue(self, num): while len(self.s2) > 0: elem = self.s2.pop() self.s1.append(elem) self.s1.append(num) while len(self.s1) > 0: elem = self.s1.pop() self.s2.append(elem) def dequeue(self): if len(self.s2) > 0: return self.s2.pop() def isEmpty(self): return len(self.s2) == 0