vector数据结构和数组非常相似,也称为单端数组
vector与普通数组区别:不同之处在于数组是静态空间,,而vector可以动态扩展
动态扩展:并不是在原空间之后持续空间,而是找更大的内存空间,如何将原数据拷贝新空间,释放原空间
vector构造函数
创建vector容器
#include<iostream>
using namespace std;
#include<vector>
void printVector(vector<int>&v) {
for (vector<int>::iterator it = v.begin(); it != v.end(); it++) {
cout << *it << " ";
}
cout << endl;
}
void test01() {
vector<int> v1;
for (int i = 0; i < 10; i++) {
v1.push_back(i);
}
printVector(v1);
vector<int>v2(v1.begin(), v1.end());
printVector(v2);
vector<int>v3(10, 100);
printVector(v3);
vector<int>v4(v3);
printVector(v4);
vector<int>v5;
v5 = v4;
printVector(v5);
vector<int>v6;
v6.assign(v5.begin(), v5.end());
printVector(v6);
}
int main() {
test01();
system("pause");
return 0;
}
vector容量和大小
#include<iostream>
using namespace std;
#include<vector>
void printVector(vector<int>&v) {
for (vector<int>::iterator it = v.begin(); it != v.end(); it++) {
cout << *it << " ";
}
cout << endl;
}
void test01() {
vector<int>v1;
for (int i = 0; i < 11; i++) {
v1.push_back(i);
}
printVector(v1);
if (v1.empty()) {
cout << "v1为空" << endl;
}
else {
cout << "v1不为空" << endl;
cout<<"v1的容量为:"<<v1.capacity()<<endl;
cout << "v1的大小为:" << v1.size() << endl;
}
v1.resize(15,100);
printVector(v1);
v1.resize(5);
printVector(v1);
}
int main() {
test01();
system("pause");
return 0;
}
vector插入和删除
push_back(ele);
pop_back();
insert(const_iterator pos, ele);
insert(const_iterator pos, int count, ele);
erase(const_iterator pos);
erase(const_iterator start, const_iterator end);
clear();
实例:
#include<iostream>
using namespace std;
#include<vector>
void printVector(vector<int>&v) {
for (vector<int>::iterator it = v.begin(); it != v.end(); it++) {
cout << *it << " ";
}
cout << endl;
}
void test01() {
vector<int>v1;
v1.push_back(10);
v1.push_back(20);
v1.push_back(30);
v1.push_back(40);
v1.push_back(50);
printVector(v1);
v1.pop_back();
printVector(v1);
v1.insert(v1.begin(), 100);
printVector(v1);
v1.insert(v1.begin(), 2, 1000);
printVector(v1);
v1.erase(v1.begin());
printVector(v1);
v1.erase(v1.begin(), v1.end());
printVector(v1);
}
int main() {
test01();
system("pause");
return 0;
}
vector数据存取
#include<iostream>
using namespace std;
#include<vector>
void test01() {
vector<int>v1;
for (int i = 0; i < 10; i++) {
v1.push_back(i);
}
for (int i = 0; i < v1.size(); i++) {
cout << v1[i] << " ";
}
cout << endl;
for (int i = 10; i < v1.size(); i++) {
cout << v1.at(i) << " ";
}
cout << endl;
cout << "第一个元素为:" << v1.front() << endl;
cout << "最后一个元素为:" << v1.back() << endl;
}
int main() {
test01();
system("pause");
return 0;
}
vector互换容器
实现两个容器互换
#include<iostream>
using namespace std;
#include<vector>
void printVector(vector<int>&v) {
for (vector<int>::iterator it = v.begin(); it != v.end(); it++) {
cout << *it << " ";
}
cout << endl;
}
void test01() {
vector<int>v1;
for (int i = 0; i < 10; i++) {
v1.push_back(i);
}
printVector(v1);
vector<int>v2;
for (int i = 10; i > 0; i--) {
v2.push_back(i);
}
printVector(v1);
printVector(v2);
v1.swap(v2);
vector<int>(v1).swap(v1);
printVector(v1);
}
int main() {
test01();
system("pause");
return 0;
}
vector容器预留空间
#include<iostream>
using namespace std;
#include<vector>
void test01() {
}
int main() {
vector<int>v;
v.reserve(100000);
int num = 0;
int *p = NULL;
for (int i = 0; i < 100000; i++) {
v.push_back(i);
if (p != &v[0]) {
p = &v[0];
num++;
}
}
cout << "num=" << num << endl;
system("pause");
return 0;
}