lc232.用栈实现队列

题目链接:

题解

简单模拟

参考代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
/*
* @lc app=leetcode.cn id=232 lang=cpp
*
* [232] 用栈实现队列
*/

// @lc code=start
class MyQueue {
stack<int>s1;
stack<int>s2;

public:
MyQueue() {

}

void push(int x) {
s1.push(x);
}

int pop() {
while(!s1.empty()) {
s2.push(s1.top());
s1.pop();
}
int ret = s2.top();
s2.pop();
while(!s2.empty()) {
s1.push(s2.top());
s2.pop();
}
return ret;
}

int peek() {
while(!s1.empty()) {
s2.push(s1.top());
s1.pop();
}
int ret = s2.top();
// s2.pop();
while(!s2.empty()) {
s1.push(s2.top());
s2.pop();
}
return ret;
}

bool empty() {
if(s1.empty()) return true;
else return false;
}
};

/**
* Your MyQueue object will be instantiated and called as such:
* MyQueue* obj = new MyQueue();
* obj->push(x);
* int param_2 = obj->pop();
* int param_3 = obj->peek();
* bool param_4 = obj->empty();
*/
// @lc code=end


作者

Ryen Xiang

发布于

2024-03-04

更新于

2024-08-05

许可协议


网络回响

评论