题目 : 用两个栈来实现一个队列,完成队列的Push和Pop操作。 队列中的元素为int类型。
思路 : 简单题 ,无需赘述
1、java版本
import java.util.Stack;
public class Solution {
static Stack<Integer> stack1 = new Stack<>();
static Stack<Integer> stack2 = new Stack<>();
public static void main(String[] args) {
Solution solution = new Solution();
solution.push(2);
solution.push(3);
solution.push(4);
solution.push(5);
// stack1.push(2);
// System.out.println(stack1.pop());
for (int i = 0; i < 4; i++) {
System.out.println(solution.pop());
}
}
public void push(int value) {
stack1.push(value);
}
public int pop() {
if (stack2.empty()) {
while (!stack1.empty()) {
stack2.push(stack1.pop());
}
}
return stack2.pop();
}
}
2、c++版本
//
// Created by stephen on 2021/3/16.
//
#include <stack>
using namespace std;
class Solution
{
public:
void push(int node) {
stack1.push(node);
}
int pop() {
int res;
if (stack2.empty()){
while (!stack1.empty()){
stack2.push(stack1.top());
stack1.pop();
}
}
res = stack2.top();
stack2.pop();
return res;
}
private:
stack<int> stack1;
stack<int> stack2;
};