数据结构期末上机

栈/队列/容器的常用语法

#include<iostream>
#include<queue>
#include<stack>
#include<vector>
using namespace std;
void use_vector() {
	vector<int> v1;
	for (int i = 0; i < 3; i++)v1.push_back(i);
	for (int i = 0; i < v1.size(); i++)cout << v1[i]<<' ';
	cout << endl;
	v1.pop_back();
	for (int i = 0; i < v1.size(); i++)cout << v1[i]<<' ';
	cout << endl;
	v1.clear();
	cout << v1.size() << endl;
	//begin()指的是第一个元素
	v1.insert(v1.begin(), 0);
	v1.insert(v1.begin(), 1);
	v1.insert(v1.begin(), 2);
	for (int i = 0; i < v1.size(); i++)cout << v1[i] << ' ';
	cout << endl;
	v1.erase(v1.begin() + 2);
	for (int i = 0; i < v1.size(); i++)cout << v1[i] << ' ';
	cout << endl;
	//左闭右开区间
	v1.erase(v1.begin(), v1.begin() + 2);
	cout << v1.size() << endl;
}

void use_stack() {
	stack<int>s;
	for (int i = 0; i < 3; i++)s.push(i);
	cout << s.top();
	cout << endl;
	s.pop();
	cout << s.size()<<endl;
	cout << s.top()<<endl;
	cout << s.empty() << endl;
	while (!s.empty())s.pop();
	cout << s.empty() << endl;
}

void use_queue() {
	queue<int>q;
	for (int i = 0; i < 3; i++)q.push(i);
	cout << q.front();
	cout << endl;
	q.pop();
	cout << q.size() << endl;
	cout << q.empty() << endl;
	while (!q.empty())q.pop();
	cout << q.empty() << endl;
}
int main() {
	use_vector();
	cout << "-----------------------------------------------\n";
	use_stack();
	cout << "-----------------------------------------------\n";
	use_queue();
	return 0;
}