JAVA_Implement Queue using Stacks_LeetCode 232

JAVA_Implement Queue using Stacks_LeetCode 232 풀이 class MyQueue { Stack<Integer> s1 = new Stack<>(); Stack<Integer> s2 = new Stack<>(); public void push(int x) { while(!s1.isEmpty()){ s2.push(s1.pop()); } s1.push(x); while(!s2.isEmpty()){ s1.push(s2.pop()); } } public int pop() { if(s1.isEmpty()){ return -1; } return s1.pop(); } public int peek() { if(s1.isEmpty()){ return -1; } return s1.peek(); } public boolean empty() { return s1.isEmpty(); } } * 출처 Level up your coding skills and quickly lan...

원문링크 : JAVA_Implement Queue using Stacks_LeetCode 232