首页
IT
登录
6mi
u
盘
搜
搜 索
IT
STL
STL
xiaoxiao
2021-12-14
19
stack的基本操作
#include <iostream>
#include <stack>
using std::stack ;
int main()
{
stack<int> s;
s.push( 12 );
s.push( 23 );
std::cout << s.size() << "\n";//栈的大小
while (!s.empty())//栈为空时为1
{
std::cout << s.top();//输出栈顶
s.pop();//弹出栈顶元素
}
std::cout << "\n";
stack<int> s1;
s1.push( 12 );
s1.push( 23 );
s1.push( 12 );
s1.push( 23 );
stack<int> s2;
s2.push( 12 );
s2.push( 23 );
s2.push( 12 );
s2.push( 33 );
std::cout << (s1 == s2);
std::cout << (s1 < s2);
return 0;
}
转载请注明原文地址: https://ju.6miu.com/read-970426.html
专利
最新回复
(
0
)
