#include <stdio.h>
#include <stack>
#include <algorithm>
using namespace std;
int main(int argc, char** argv)
{
stack<int> s;
//返回栈顶元素
//printf("top(): %d\n", s.top()); //出错
//检测栈是否为空
printf("empty(): %d\n",s.empty());
//从栈中弹出元素,返回值为void
//s.pop(); //出错
//返回栈的大小
printf("size(): %d\n", s.size());
//把元素压入栈中,返回值为void
s.push(1);
s.push(2);
s.push(3);
s.emplace(10);
//返回栈顶元素
printf("top(): %d\n", s.top());
//返回栈的大小
printf("size(): %d\n",s.size());
//从栈中弹出元素,返回值为void
s.pop();
//返回栈顶元素
printf("top(): %d\n", s.top());
//检测栈是否为空
printf("empty(): %d\n", s.empty());
//初始化
stack<int> s1 = s;
stack<int> s2(s);
stack<int> s3;
s3 = s;
printf("s1.top(): %d, s2.top(): %d, s3.top(): %d\n", s1.top(), s2.top(), s3.top());
//比较大小
stack<int> s4;
stack<int> s5;
s4.push(1);
s4.push(2);
s4.push(3);
s5.push(2);
s5.push(1);
if (s4 == s5)
printf("s4 eq s5\n");
else if (s4 < s5)
printf("s4 lt s5\n");
else if (s4 > s5)
printf("s4 gt s5\n");
stack<int> s6;
stack<int> s7;
s6.push(1);
s6.push(2);
s7.push(1);
s7.push(2);
if (s6 == s7)
printf("s6 eq s7\n");
else if (s6 < s7)
printf("s6 lt s7\n");
else if (s6 > s7)
printf("s6 gt s7\n");
//交换
stack<int> s8;
stack<int> s9;
s8.push(1);
s9.push(2);
s8.swap(s9);
printf("s8.top(): %d, s9.top(): %d\n", s8.top(), s9.top());
getchar();
return 0;
}
运行结果为:
empty(): 1
size(): 0
top(): 10
size(): 4
top(): 3
empty(): 0
s1.top(): 3, s2.top(): 3, s3.top(): 3
s4 lt s5
s6 eq s7
s8.top(): 2, s9.top(): 1