JAVA_Implement Stack using Queues_LeetCode 225 풀이 class MyStack { ArrayDeque<Integer> q; public MyStack() { q = new ArrayDeque<>(); } public void push(int x) { q.addFirst(x); } public int pop() { return q.remove(); } public int top() { return q.peekFirst(); } public boolean empty() { return q.isEmpty(); } } * 출처 Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com...
#ImplementStackusingQueues_LeetCode225
#JAVA
#JAVA_ImplementStackusingQueues
#JAVA_ImplementStackusingQueues_LeetCode225
#JAVA_LeetCode225
원문링크 : JAVA_Implement Stack using Queues_LeetCode 225