#include <iostream>
#include <cstring>
using namespace std;
const int maxn = 100000 + 5;
int stk[maxn];
int m, x, tt;
string s;
int main()
{
cin >> m;
while (m --)
{
cin >> s;
if (s == "push")
{
cin >> x;
stk[++ tt] = x;
}
if (s == "query")
{
cout << stk[tt] << endl;
}
if (s == "pop")
{
tt --;
}
if (s == "empty")
{
cout << (tt ? "NO" : "YES") << endl;
}
}
return 0;
}
C++栈
最新推荐文章于 2024-08-06 16:12:14 发布