1.头文件:#include <stack>
2.构造一个空栈:stack<elem>s;
3.返回栈顶数据:s.top();
4.在栈顶增加数据:s.push(elem);
5.弹出栈顶元素:s.pop();
6.判断栈是否为空:s.empty();若空返回true
7.返回栈中数据个数:s.size();
#include <cstdio>
#include <stack>
using namespace std;
int main()
{
stack<int>s;
s.push(3);
printf("top=%d\n",s.top());
printf("size=%d\n",s.size());
if(!s.empty())
{
printf("No empty\n");
}
s.pop();
printf("pop_after:%d\n",s.size());
return 0;
}