STL stack 栈（后进先出）

#include<iostream>#include<cstdio>#include<stack>using namespace std;int main(){stack<int> st,st1;for(int i=0;i<5;i++){st.push(i);} printf("原数据栈顶元素为%d\n",st.top());//取栈顶元素printf("原数据stack内元素个数：%d\n",st.size());for(int i=0;i<=2;i++){st.pop();}printf("pop前三个以后栈顶元素为%d\n",st.top());if(st1.empty()==true){printf("st1:Empty!\n");}else{printf("st1:NOT Empty!\n");}st1.push(1);printf("push后：\n");if(st1.empty()==true){printf("st1:Empty!\n");}else{printf("st1:NOT Empty!\n");}return 0;}