leetcodepushfront-stack_w_2_queues:stack_w_2_queues

leetcode 推前stack_w_2_queues 力码 编队 /* Q. Implement the following operations of a stack using queues: - push(x): Push element x onto stack. - pop(): Removes the element on top of the stack. - top(): Get the top element. - empty(): Return whether the stack is empty. Note: - You must use only standard operations of a queue, which means only push to back, peek/pop from front, size, and is empty operations are valid. - Depending on your language, queue may not be supported natively. - You may simulate