232 Implement Queue using Stacks
来源:互联网 发布:淘宝延长收货会怎样 编辑:程序博客网 时间:2024/06/05 06:40
class MyQueue {
Stack<Integer> stack = new Stack<Integer>();
Stack<Integer> tmp = new Stack<Integer>();
// Push element x to the back of queue.
public void push(int x) {
stack.push(x);
}
// Removes the element from in front of queue.
public void pop() {
int size = stack.size();
int tVal = 0;
for(int i = 0; i < size; ++i){
tVal = stack.peek();
tmp.push(tVal);
stack.pop();
}
tmp.pop();
int tSize = tmp.size();
int tmpVal = 0;
for(int j = 0; j< tSize; ++j){
tmpVal = tmp.peek();
stack.push(tmpVal);
tmp.pop();
}
}
// Get the front element.
public int peek() {
int size = stack.size();
int tVal = 0;
for(int i = 0; i < size; ++i){
tVal = stack.peek();
tmp.push(tVal);
stack.pop();
}
int res = tmp.peek();
int tSize = tmp.size();
int tmpVal = 0;
for(int j = 0; j< tSize; ++j){
tmpVal = tmp.peek();
stack.push(tmpVal);
tmp.pop();
}
return res;
}
// Return whether the queue is empty.
public boolean empty() {
if(stack.size() > 0) return false;
else return true;
}
}
Stack<Integer> stack = new Stack<Integer>();
Stack<Integer> tmp = new Stack<Integer>();
// Push element x to the back of queue.
public void push(int x) {
stack.push(x);
}
// Removes the element from in front of queue.
public void pop() {
int size = stack.size();
int tVal = 0;
for(int i = 0; i < size; ++i){
tVal = stack.peek();
tmp.push(tVal);
stack.pop();
}
tmp.pop();
int tSize = tmp.size();
int tmpVal = 0;
for(int j = 0; j< tSize; ++j){
tmpVal = tmp.peek();
stack.push(tmpVal);
tmp.pop();
}
}
// Get the front element.
public int peek() {
int size = stack.size();
int tVal = 0;
for(int i = 0; i < size; ++i){
tVal = stack.peek();
tmp.push(tVal);
stack.pop();
}
int res = tmp.peek();
int tSize = tmp.size();
int tmpVal = 0;
for(int j = 0; j< tSize; ++j){
tmpVal = tmp.peek();
stack.push(tmpVal);
tmp.pop();
}
return res;
}
// Return whether the queue is empty.
public boolean empty() {
if(stack.size() > 0) return false;
else return true;
}
}
0 0
- 232 Implement Queue using Stacks
- 232 Implement Queue using Stacks
- 232 - Implement Queue using Stacks
- [232]Implement Queue using Stacks
- 232 Implement Queue using Stacks
- [232] Implement Queue using Stacks
- Implement Queue using Stacks
- Implement Queue using Stacks
- Implement Queue using Stacks
- Implement Queue using Stacks
- Implement Queue using Stacks
- Implement Queue using Stacks
- Implement Queue using Stacks
- Implement Queue using Stacks
- Implement Queue using Stacks
- Implement Queue using Stacks
- Implement Queue using Stacks
- Implement Queue using Stacks
- 陈力:传智播客古代 珍宝币 泡泡龙游戏开发第20讲:一个IP绑定多个域名
- 【Mark】值得收藏!神级代码编辑器 Sublime Text 全程指南
- Delphi REST 服务器返回UTF16编码转换成正常string
- Android验证码倒计时的处理
- Python数据结构创建的具体应用方案详细描述
- 232 Implement Queue using Stacks
- 猎头是这样看简历的,你知道吗?
- 深度学习在图像识别中的应用--学习笔记6
- matlib complie C++ with opencv
- 容器
- python实现查找文件名包含指定字符串的文件
- ProgressBar自定义
- 云捷平台
- Axis2创建WebService实例