Vector容器
//动态数组
#include<iostream>
#include<vector>
using namespace std;
void Print(vector<int>& v)
{
//vector<int>::iterator迭代器类型
for (vector<int>::iterator it = v.begin(); it < v.end(); it++)
{
cout << *it << " ";
}
cout << endl;
}
//初始化
void text1()
{
vector<int> v; //默认参数构造
int arr[] = {1,2,3,4};
vector<int> v1(arr,arr + sizeof(arr) / sizeof(int)); //类似于下一种
vector<int> v2(v1.begin(), v1.end());
vector<int> v3(v2);
//输出
//for_each(v.begin(), v.end(), Print); //第三个参数回调函数
Print(v1);
Print(v2);
Print(v3);
}
//赋值
void text2()
{
int v[] = { 10,20,30,40 };
vector<int> v1(v, v + sizeof(v) / sizeof(int));
vector<int> v2(v1.begin(), v1.end());
//重载
vector<int> v3;
v3 = v2;
int arr[] = { 100,200,300,400 };
vector<int> v4(arr, arr + sizeof(v) / sizeof(int));
Print(v1);
Print(v2);
Print(v3);
Print(v4);
cout << "交换后:" << endl;
v1.swap(v4); //交换
Print(v1);
Print(v2);
Print(v3);
Print(v4);
}
//大小操作
void text3()
{
int arr[] = { 10,20,30,40 };
vector<int> v(arr, arr + sizeof(arr) / sizeof(int));
cout << "容器的元素个数:" << v.size() << endl;
if (v.empty())
{
cout << "空" << endl;
}
else
{
cout << "不空!" << endl;
}
Print(v);
//重新指定容器的大小
v.resize(2);
Print(v);
v.resize(4, 1);
Print(v);
for (int i = 0; i < 1000; i++)
{
v.push_back(i);
}
cout << "容器的元素个数:" << v.size() << endl;
cout << "容器的容量:" << v.capacity() << endl; //大于等于元素个数
}
//存储数据
void text4()
{
int arr[] = { 10,20,30,40 };
vector<int> v(arr, arr + sizeof(arr) / sizeof(int));
for (int i = 0; i < v.size(); i++)
{
cout << v[i] << " "; //不抛异常
}
cout << endl;
for (int i = 0; i < v.size(); i++)
{
cout << v.at(i) << " "; //at抛异常
}
cout << endl;
cout << "第一个元素:" << v.front() << endl;
cout << "最后一个元素:" << v.back() << endl;
}
//插入和删除
void text5()
{
vector<int> v;
//添加元素
v.push_back(10);
v.push_back(20);
//插入元素
v.insert(v.begin(), 30);
v.insert(v.end(), 100);
v.insert(v.begin() + 2, 5000); //支持随机访问
Print(v);
//删除最后一个元素
v.pop_back();
Print(v);
v.erase(v.begin());
Print(v);
v.erase(v.begin() + 1, v.end());
Print(v);
v.clear(); //清除容器元素
cout << "元素大小:" << v.size() << endl;
}
//swap收缩空间
void text6()
{
vector<int> v;
for (int i = 0; i < 10000; i++)
{
v.push_back(i);
}
cout << "大小:" << v.size() << endl;
cout << "容量:" << v.capacity() << endl;
v.resize(10);
cout << "***************" << endl;
cout << "大小:" << v.size() << endl;
cout << "容量:" << v.capacity() << endl;
//收缩空间
vector<int>(v).swap(v);
cout << "***************" << endl;
cout << "大小:" << v.size() << endl;
cout << "容量:" << v.capacity() << endl;
}
//reserve 预留空间
void text7()
{
int num = 0;
int* address = NULL;
vector<int> v;
v.reserve(100000); //提前知道容器大概要存储的元素个数 可以使用reserve预留空间 提高效率
for (int i = 0; i < 100000; i++)
{
v.push_back(i);
if (address != &(v[0]))
{
address = &v[0];
num++;
}
}
cout << "num:" << num << endl;
}
int main()
{
//text1();
//text2();
//text3();
//text4();
//text5();
//text6();
text7();
return 0;
}
String容器
#include<iostream>
#include<string>
using namespace std;
//初始化
void text1()
{
string s1;
string s2(10, 'a');
string s3("sadmoney");
string s4(s3); //拷贝构造
cout << s1 << endl;
cout << s2 << endl;
cout << s3 << endl;
cout << s4 << endl;
}
//赋值操作
void text2()
{
string s = "abcdefg";
//重载[]操作符 无法处理越界
for (int i = 0; i < s.size(); i++)
{
cout << s[i] << " ";
}
cout << endl;
//at成员函数
for (int i = 0; i < s.size(); i++)
{
cout << s.at(i) << " ";
}
cout << endl;
}
//拼接操作 加入尾部
void text3()
{
string s = "11111";
string s2 = "abcdef";
s += "222222";
s += s2;
cout << s << endl;
string s3 = "asd";
s2.append(s3);
cout << s2 << endl;
string s4 = s2 + s3;
cout << s4 << endl;
}
//查找操作
void text4()
{
string s = "asdfgjhkfgi";
//查找第一次出现的位置
int pos = s.find("fg");
cout << pos << endl;
//查找最后一次出现的位置
int prs = s.rfind("fg");
cout << prs << endl;
}
//替换操作
void text5()
{
string s = "abcdefg";
s.replace(0, 2, "111");
cout << s << endl;
}
//比较操作
void text6()
{
string a = "abcd";
string b = "abce";
if (a.compare(b)==0)
{
cout << "相等" << endl;
}
else
{
cout << "不相等" << endl;
}
}
//子串操作
void text7()
{
string s = "abcdefg";
string ps = s.substr(1, 3);
cout << ps << endl;
}
//插入删除
void text8()
{
string s = "abcdefg";
s.insert(3, "123");
cout << s << endl;
s.erase(0, 2); //从第0个位置开始删除两个元素
cout << s << endl;
}
int main()
{
//text1();
//text2();
//text3();
//text4();
//text5();
//text6();
//text7();
text8();
return 0;
}
List容器
//链表
#include<iostream>
#include<list>
using namespace std;
void Print(list<int>& ls)
{
for (list<int>::iterator i = ls.begin(); i != ls.end(); i++)
{
cout << *i << " ";
}
cout << endl;
}
//初始化
void text1()
{
list<int> ls1;
list<int> ls2(10,5); //有参构造
list<int> ls3(ls2); //拷贝构造
list<int> ls4(ls2.begin(), ls2.end());
Print(ls2);
}
//插入删除
void text2()
{
list<int> ls;
ls.push_back(100);
ls.push_back(300);
ls.push_front(200);
ls.push_front(200); //ls.insert(ls.begin, 200); 一样
//ls.insert(ls.begin + 1, 500); 错误
list<int>::iterator it = ls.begin();
it++;
ls.insert(it, 500);
Print(ls);
//ls.pop_back();
//ls.pop_front();
//ls.erase(ls.begin(), ls.end()); //ls.chear();
ls.remove(200); //删除匹配的所有值
Print(ls);
}
//赋值操作
void text3()
{
list<int> ls;
ls.assign(10, 10);
list<int> ls2;
ls2 = ls;
ls2.swap(ls); //交换
}
//反转
void text4()
{
list<int> ls;
for (int i = 0; i < 10; i++)
{
ls.push_back(i);
}
Print(ls);
//元素反转
ls.reverse();
Print(ls);
}
//排序
bool Big(int a, int b) //从大到小排序回调函数
{
return a > b;
}
void text5()
{
list<int> ls;
ls.push_back(20);
ls.push_back(40);
ls.push_back(10);
ls.push_back(50);
Print(ls);
ls.sort(); //默认从小到大
Print(ls);
ls.sort(Big); //从大到小
Print(ls);
//算法中的sort只支持可随机访问的容器 list不支持随机访问
}
int main()
{
//text1();
//text2();
//text4();
text5();
return 0;
}
Stack容器
//栈 先进后出
#include<iostream>
#include<stack>
using namespace std;
void text1()
{
//初始化
stack<int> s1;
stack<int> s2(s1);
//进栈
s1.push(10);
s1.push(20);
s1.push(30);
// 30 20 10
cout << "栈顶元素:" << s1.top() << endl;
s1.pop(); //删除栈顶元素
s1.push(50);
cout << "打印栈元素:" << endl;
while (!s1.empty())
{
cout << s1.top() << " ";
s1.pop();
}
cout << endl;
cout << "size:" << s1.size() << endl;
}
int main()
{
text1();
return 0;
}
Deque容器
//双端数组
#include<iostream>
#include<deque>
using namespace std;
void Print(deque<int>& d)
{
for (deque<int>::iterator it = d.begin(); it < d.end(); it++)
{
cout << *it << " ";
}
cout << endl;
}
//初始化
void text1()
{
deque<int> d1;
deque<int> d2(10, 5); //10个5
deque<int> d3(d2.begin(), d2.end()); //迭代器构造
deque<int> d4(d3); //构造函数构造
Print(d4);
}
//赋值和大小操作
void text2()
{
deque<int> d1;
deque<int> d2;
deque<int> d3;
d1.assign(10, 5); //10个5
d2.assign(d1.begin(), d1.end()); //迭代器指定区间赋值
d3 = d2; //等号赋值
d1.swap(d2); //交换两个空间的元素
if (d1.empty())
{
cout << "空!" << endl;
}
else
{
cout << "不空!" << endl;
}
d1.size(); //元素大小
d2.resize(10, 5); //少了用5补充
}
//插入删除
void text3()
{
deque<int> d;
d.push_back(100); //尾部插入
d.push_front(500); //头部插入
d.push_back(200);
d.push_front(300);
Print(d); //300 500 100 200
int val = d.front(); //拿到第一个元素
d.pop_front(); //无返回值 删除第一个元素
int val2 = d.back(); //拿到最后一个元素
d.pop_back(); //删除最后一个元素
}
int main()
{
//text1();
//text2();
text3();
return 0;
}
Queue容器
//双端数组
#include<iostream>
#include<deque>
using namespace std;
void Print(deque<int>& d)
{
for (deque<int>::iterator it = d.begin(); it < d.end(); it++)
{
cout << *it << " ";
}
cout << endl;
}
//初始化
void text1()
{
deque<int> d1;
deque<int> d2(10, 5); //10个5
deque<int> d3(d2.begin(), d2.end()); //迭代器构造
deque<int> d4(d3); //构造函数构造
Print(d4);
}
//赋值和大小操作
void text2()
{
deque<int> d1;
deque<int> d2;
deque<int> d3;
d1.assign(10, 5); //10个5
d2.assign(d1.begin(), d1.end()); //迭代器指定区间赋值
d3 = d2; //等号赋值
d1.swap(d2); //交换两个空间的元素
if (d1.empty())
{
cout << "空!" << endl;
}
else
{
cout << "不空!" << endl;
}
d1.size(); //元素大小
d2.resize(10, 5); //少了用5补充
}
//插入删除
void text3()
{
deque<int> d;
d.push_back(100); //尾部插入
d.push_front(500); //头部插入
d.push_back(200);
d.push_front(300);
Print(d); //300 500 100 200
int val = d.front(); //拿到第一个元素
d.pop_front(); //无返回值 删除第一个元素
int val2 = d.back(); //拿到最后一个元素
d.pop_back(); //删除最后一个元素
}
int main()
{
//text1();
//text2();
text3();
return 0;
}