剑指offer面试题七：用两个栈实现队列

2016-7-29 15:47| 发布者: zhangjf| 查看: 676| 评论: 0

摘要: import java.util.Stack;public class Queue { private StackInteger stack1 = new StackInteger(); private StackInteger stack2 = new StackInteger(); public void appendTail(int element){ stack1.push(elem ...

<无详细内容>

import java.util.Stack;
public class Queue {
private Stack<Integer> stack1 = new Stack<Integer>();
private Stack<Integer> stack2 = new Stack<Integer>();
public void appendTail(int element){
stack1.push(element);
}
public int deleteHead(){
if(stack2.size() <= 0){
while(stack1.size() > 0){
int data = stack1.pop().intValue();
stack2.push(data);
}
}
if(stack2.size() == 0){
System.out.println("队列为空");
return -1;
}
int data = stack2.pop().intValue();
return data;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
Queue q = new Queue();
q.appendTail(1);
q.appendTail(2);
q.appendTail(3);
System.out.println(q.deleteHead());
System.out.println(q.deleteHead());
System.out.println(q.deleteHead());
//q.deleteHead();
}
}

复制代码

收藏邀请

上一篇：Java设计模式之(Strategy模式）下一篇：寻找当前字符串最大回文串

		自动登录	找回密码
密码			立即注册

剑指offer面试题七：用两个栈实现队列

最新评论

相关分类