topic requirement:
无
thoughts:
可以利用两个队列实现一个栈。定义两个队列,一个data队列,一个help队列,数据压栈的时候只压入data队列
设计两个栈,一个命名为push、一个为pop。把数据输入push栈,把从pop栈输出的数据作为队列的输出结果
①push倒的时候必须要倒完
②pop内有东西则不能倒
code:
public static class TwoStacksQueue {
private Stack<Integer> stackPush;
private Stack<Integer> stackPop;
public TwoStacksQueue() {
stackPush = new Stack<Integer>();
stackPop = new Stack<Integer>();
}
public void push(int pushInt) {
stackPush.push(pushInt);
}
public int poll() {
if (stackPop.empty() && stackPush.empty()) {
throw new RuntimeException("Queue is empty!");
} else if (stackPop.empty()) {
while (!stackPush.empty()) {
stackPop.push(stackPush.pop());
}
}
return stackPop.pop();
}
public int peek() {
if (stackPop.empty() && stackPush.empty()) {
throw new RuntimeException("Queue is empty!");
} else if (stackPop.empty()) {
while (!stackPush.empty()) {
stackPop.push(stackPush.pop());
}
}
return stackPop.peek();
}
}
public static class TwoQueuesStack {
private Queue<Integer> queue;
private Queue<Integer> help;
public TwoQueuesStack() {
queue = new LinkedList<Integer>();
help = new LinkedList<Integer>();
}
public void push(int pushInt) {
queue.add(pushInt);
}
public int peek() {
if (queue.isEmpty()) {
throw new RuntimeException("Stack is empty!");
}
while (queue.size() != 1) {
help.add(queue.poll());
}
int res = queue.poll();
help.add(res);
swap();
return res;
}
public int pop() {
if (queue.isEmpty()) {
throw new RuntimeException("Stack is empty!");
}
while (queue.size() != 1) {
help.add(queue.poll());
}
int res = queue.poll();
swap();
return res;
}
private void swap() {
Queue<Integer> tmp = help;
help = queue;
queue = tmp;
}
}
reference:左神
encouragement:
读书学习工作健身吃饭睡觉都是绝对能给你带来丰厚回报的事情,得先把这些做好了
本文探讨了如何使用两个队列实现一个栈的功能,以及如何利用两个栈实现队列的操作。通过具体代码展示了数据结构之间的转换方法,提供了一种在受限环境下灵活运用数据结构的思路。
162

被折叠的 条评论
为什么被折叠?



