C++ 提高教程 STL deque -大小操作 和 插入和删除

Posted 2021-11-02 行码阁119

一、大小操作 

# include<iostream>
#include<deque>
# include<algorithm>
# include<string>
using namespace std;

void printVector(const deque<int>& v) //容器中的数不可以需改
{
	for (deque<int>::const_iterator it = v.begin(); it != v.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}
void test01()
{
	deque<int>v1;
	for (int i = 0; i < 10; i++)
	{
		v1.push_back(i);
	}
	printVector(v1);
	if (v1.empty())
	{
		cout << "v1为空" << endl;
	}
	else
	{
		cout << "v1不为空" << endl;
	}
	cout << "v1的大小:" << v1.size() << endl;

	v1.resize(5);
	printVector(v1);
	cout << "v1的大小:" << v1.size() << endl;

	v1.resize(10,5);
	printVector(v1);
	cout << "v1的大小:" << v1.size() << endl;



}
int main()
{
	test01();
	system("pause");
	return 0;
}

二、插入和删除

# include<iostream>
#include<deque>
# include<algorithm>
# include<string>
using namespace std;

void printVector(const deque<int>& v) //容器中的数不可以需改
{
	for (deque<int>::const_iterator it = v.begin(); it != v.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}
void test01()
{
	deque<int>v1;
	for (int i = 0; i < 10; i++)
	{
		v1.push_back(i);
	}
	printVector(v1);
	if (v1.empty())
	{
		cout << "v1为空" << endl;
	}
	else
	{
		cout << "v1不为空" << endl;
	}
	cout << "v1的大小:" << v1.size() << endl;

	v1.resize(5);
	printVector(v1);
	cout << "v1的大小:" << v1.size() << endl;

	v1.resize(10,5);
	printVector(v1);
	cout << "v1的大小:" << v1.size() << endl;

}
//两端操作
void test02()
{
	deque<int>d1;
	d1.push_back(10);
	d1.push_back(20);
	//头插
	d1.push_front(10);
	d1.push_front(10);
	printVector(d1);
	//尾删
	d1.pop_back();
	printVector(d1);
	//头删
	d1.pop_front();
	d1.clear();
	printVector(d1);

}

void test03()
{
	deque<int>d1;
	d1.push_back(200);
	d1.push_back(100);
	//头插
	d1.push_front(10);
	d1.push_front(20);
	printVector(d1);

	//insert插入
	d1.insert(d1.begin(), 1000);
	d1.insert(d1.begin(),2, 1000);
	printVector(d1);

	//按照区间来进行插入
	deque<int> d2;
	d2.push_back(1);
	d2.push_back(2);
	d2.push_back(3);

	d1.insert(d1.begin(), d2.begin(), d2.end());
	printVector(d1);
	deque<int>::iterator it = d1.begin();
	it++;
	d1.erase(it);
	printVector(d1);

}


int main()
{
	test03();
	system("pause");
	return 0;
}