【数据结构】栈与队列 Part1:栈的创建与相关函数

 1 #include<iostream>
 2 #include<stdio.h>
 3 #include<stdlib.h>
 4 #include<algorithm>
 5 #include<map>
 6 #include<stack>
 7 #include<queue>
 8 
 9 using namespace std;
10 
11 int main()
12 {
13     stack<int> s1;
14     int x=3;
15     s1.push(x);
16     cout<<"x="<<s1.top()<<endl;
17     int y;
18     y=s1.top();
19     cout<<"y="<<y<<endl;
20     cout<<"size: "<<s1.size()<<endl;
21     cout<<"empty? "<<s1.empty()<<endl;
22     s1.pop();
23     cout<<"size: "<<s1.size()<<endl;
24     cout<<"empty? "<<s1.empty()<<endl;
25     return 0;
26 }