[leetcode-225] Implement Queue using Stacks

LeetCode-225

Implement Queue using Stacks : Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack

note : last-in-first-out (LIFO)

Answer

        :::python

class MyStack:
def init(self):
self.temp = []
def push(self, x: int) -> None:
self.temp.append(x)
def pop(self) -> int:
return self.temp.pop()
def top(self) -> int:
return self.temp[-1]
def empty(self) -> bool:
if self.temp==[]:
return True
else:
return False
# Your MyStack object will be instantiated and called as such:
# obj = MyStack()
# obj.push(x)
# param_2 = obj.pop()
# param_3 = obj.top()
# param_4 = obj.empty()

Result : 15ms Memory: 14mb