C++之stack
#include <iostream>
#include<stack>
using namespace std;//栈stack容器void test()
{//特点:符合先进后出的数据结构stack<int> s;//入栈s.push(10);s.push(20);s.push(30);s.push(40);//查看栈中元素的个数cout<<"stack size:"<<s.size()<<endl;//只要栈不为空,查看栈顶,并且执行出栈while (!s.empty()) {//查看栈顶cout<<"stack top"<<s.top()<<endl;//出栈s.pop();}//查看栈中元素的个数cout<<"stack size:"<<s.size()<<endl;
}int main()
{test();cout << "Hello World!" << endl;return 0;
}
C++之queue
#include <iostream>
#include<queue>
using namespace std;//队列queue容器void test()
{//特点:符合先进后出的数据结构queue<int> s;//入队s.push(10);s.push(20);s.push(30);s.push(40);//查看队中元素的个数cout<<"queue size:"<<s.size()<<endl;//只要栈不为空,查看栈顶,并且执行出栈while (!s.empty()) {//查看队头cout<<"queue front"<<s.front()<<endl;//查看队尾cout<<"quque back"<<s.back()<<endl;//出队s.pop();}//查看队中元素的个数cout<<"queue size:"<<s.size()<<endl;
}int main()
{test();cout << "Hello World!" << endl;return 0;
}