225. Implement Stack using Queues
来源:互联网 发布:网络营销策划方案 论文 编辑:程序博客网 时间:2024/05/16 03:17
class MyStack {
Queue<Integer> q = new LinkedList<Integer>();
// Push element x onto stack.
public void push(int x) {
q.add(x);
}
// Removes the element on top of the stack.
public void pop() {
int size = q.size();
for(int i = 1; i < size; i++)
q.add(q.remove());
q.remove();
}
// Get the top element.
public int top() {
int size = q.size();
for(int i = 1; i < size; i++)
q.add(q.remove());
int ret = q.remove();
q.add(ret);
return ret;
}
// Return whether the stack is empty.
public boolean empty() {
return q.isEmpty();
}
}
Queue<Integer> q = new LinkedList<Integer>();
// Push element x onto stack.
public void push(int x) {
q.add(x);
}
// Removes the element on top of the stack.
public void pop() {
int size = q.size();
for(int i = 1; i < size; i++)
q.add(q.remove());
q.remove();
}
// Get the top element.
public int top() {
int size = q.size();
for(int i = 1; i < size; i++)
q.add(q.remove());
int ret = q.remove();
q.add(ret);
return ret;
}
// Return whether the stack is empty.
public boolean empty() {
return q.isEmpty();
}
}
0 0
- 225.Implement Stack using Queues
- 225. Implement Stack using Queues
- 225. Implement Stack using Queues
- 225. Implement Stack using Queues
- 225. Implement Stack using Queues
- 225. Implement Stack using Queues
- 225. Implement Stack using Queues
- 225. Implement Stack using Queues
- 225. Implement Stack using Queues
- 225. Implement Stack using Queues
- 225. Implement Stack using Queues
- 225. Implement Stack using Queues
- 225. Implement Stack using Queues
- 225. Implement Stack using Queues
- 225. Implement Stack using Queues
- 225. Implement Stack using Queues
- 225. Implement Stack using Queues
- 225. Implement Stack using Queues
- 112. Path Sum
- HDU 1711(kmp)
- 9. Palindrome Number
- Android Studio ——在不root手机的情况下读取Data目录下的文件
- Java使用之坑货总结
- 225. Implement Stack using Queues
- 懒人公约数
- (java) Bulb Switcher
- Ultimaker 2:整体性能出众的家用3D打印机
- update-manager 设置导致网络没了
- 2016——大数据版图
- C语言结构体内存对齐(计算结构体内存大小)
- 如何连接新浪sae共享数据库
- Codeforces Round #256 (Div. 2) D Multiplication Table (二分)