C++Vector模板类学习笔记

Vichayturen123

已于 2022-03-12 20:38:00 修改

阅读量1.1k

点赞数 1

文章标签： c++ 学习开发语言

于 2022-03-12 18:59:49 首次发布

本文链接：https://blog.csdn.net/m0_55630586/article/details/123448399

版权

in[1]:

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void print_vti(vector<int> vt) {
    int i;
    cout<<'[';
    if(vt.empty()) {
        cout<<']'<<endl;
        return;
    }else {
    for(i=0; i<vt.size()-1; i++)
        cout<<vt[i]<<',';
    cout<<vt.at(i)<<']'<<endl;
    }
}//打印vector为[2,3,...]形式

bool comp(const int &a,const int &b) {
    return a>b;
}//自定义排序算法,后面要用

void print_each(int num) {
    cout<<num<<';';
}//自定义输出算法，后面要用

int main(){
    //...
}

in[2]:

vector<int> v1;
print_vti(v1);
vector<int> v2(5);
print_vti(v2);
vector<int> v3(5,2);
print_vti(v3);
vector<int> v4(v3);
print_vti(v4);
vector<int> v5(v4.begin(),v4.begin()+2);
print_vti(v5);

[]
[0,0,0,0,0]
[2,2,2,2,2]
[2,2,2,2,2]
[2,2]

in[3]:

int a1[] = {3,4,2};
vector<int> v6(a1);
print_vti(a1);

不存在从 “int [3]” 转换到 “std::vector<int,std::allocator>” 的适当构造函数

in[4]:

vector<int> v6(3,1);
cout<<v6.empty()<<endl;
cout<<v6.size()<<endl;
vector<int> v7(2,2);
print_vti(v7);
cout<<v7.front()<<endl;
v7.clear();
print_vti(v7);
v7.swap(v6);
print_vti(v7);

0
3
[2,2]
2
[]
[1,1,1]

in[5]:

vector<int> v8(2);
print_vti(v8);
v8.push_back(5);
print_vti(v8);
v8.insert(v8.begin()+1,777);
print_vti(v8);
v8.insert(v8.begin()+2,3,777);
print_vti(v8);
vector<int> v8_2(3);
print_vti(v8_2);
v8_2.insert(v8_2.begin()+1,v8.begin(),v8.end());
print_vti(v8_2);

[0,0]
[0,0,5]
[0,777,0,5]
[0,777,777,777,777,0,5]
[0,0,0]
[0,0,777,777,777,777,0,5,0,0]

in[6]:

v8.pop_back();
print_vti(v8);
v8.erase(v8.begin()+4);
print_vti(v8);
v8.erase(v8.begin()+1,v8.end()-2);
print_vti(v8);

[0,777,777,777,777,0]
[0,777,777,777,0]
[0,777,0]

in[7]:

v8[0]=1;
v8.at(1)=2; //等价于int &addr=v8.at(1); addr=2;
vector<int>::iterator it=v8.begin()+2;
*it=3;
print_vti(v8);

[1,2,3]

in[8]:

for_each(v8.begin(),v8.end(),print_each);
cout<<endl;
reverse(v8.begin(),v8.end()-1);
print_vti(v8);
sort(v8.begin(),v8.end());
print_vti(v8);
sort(v8.begin(),v8.end(),comp);
print_vti(v8);
random_shuffle(v8.begin(),v8.end());
print_vti(v8);