题解 | #【模板】栈#
【模板】栈
https://www.nowcoder.com/practice/104ce248c2f04cfb986b92d0548cccbf
#include <iostream> #include <stack> #include <string> using namespace std; int main() { int t, n, x; string s; stack<int> sta; cin >> n; while (n--) { // 注意 while 处理多个 case cin >> s; if(s=="push") { cin >> x; sta.push(x); } else{ if(sta.empty()){ cout << "error" << endl; continue; } else{ if(s=="pop") { cout << sta.top() << endl; sta.pop(); } if(s=="top")cout << sta.top() << endl; } } } } // 64 位输出请用 printf("%lld")