Notice
Recent Posts
Recent Comments
Link
목록2022/12/16 (1)
.Zzumbong

난이도 [ 😊 ] Easy 문제 설명 Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push, peek, pop, and empty). Implement the MyQueue class: void push(int x) Pushes element x to the back of the queue. int pop() Removes the element from the front of the queue and returns it. int peek() Returns the element at the front ..
coding test/leetCode
2022. 12. 16. 11:23