C++STLのvector用法まとめ

int a[3] = {10, 20, 30};
vector<int> v1; //{}
vector<int> v2(3); //{0, 0, 0}
vector<int> v3 {1, 2, 3, 4, 5}; //vector v3 = {1, 2, 3, 4, 5};
vector<int> v4(3,10); //{10, 10, 10}
vector<int> v5 = v3; //vector v5(v3);
vector<int> v6(v3.begin()+1, v3.end()); //vector v6(&a[0], &a[3]);

//{{}}
vectorint>> vec1;
//1 1 1
//1 1 1
vectorint>> vec2(2, vector<int>(3,1));
//1 1 1
//2 3 4
vectorint>> vec3 = {{1, 1, 1},{2, 3, 4}};

for(int i = 0; i < v3.size(); ++i){
    cout << v3[i] << " ";
}
for(vector<int>::iterator it = v3.begin(); it != v3.end(); it++){
    cout << *it << " ";
}
for(auto i:v3){
    cout << i << " ";
}

for (auto it = v5.rbegin(); it != v5.rend(); it++){
    cout << *it << " ";
}

v3.size();

v3.front();
v3.back();

v3.empty();

//v1{}
v1.push_back(1); //{1}
v1.push_back(2); //{1, 2}
v1.push_back(3); //{1, 2, 3}
v1.pop_back(); //{1, 2}
v1.pop_back(); //{1}
v1.pop_back(); //{}

//v3{1, 2, 3, 4, 5}
v3.insert(v3.begin()+1, 0); //{1, 2, 3, 4, 5}->{1, 0, 2, 3, 4, 5}
v3.insert(v3.end(), 0); //{1, 0, 2, 3, 4, 5}->{1, 0, 2, 3, 4, 5, 0}
v3.insert(v3.begin(), v4.begin(), v4.end()); //{1, 0, 2, 3, 4, 5, 0}->{10, 10, 10, 1, 0, 2, 3, 4, 5, 0}

//v2{0, 0, 0} v4{10, 10, 10}
v2.insert(v2.end(), v4.begin(), v4.end());//{0, 0, 0}->{0, 0, 0, 10, 10, 10}

v3.erase(v3.begin()+4); //{10, 10, 10, 1, 0, 2, 3, 4, 5, 0}->{10, 10, 10, 1, 2, 3, 4, 5, 0}
//erase()              ，            ，         
//*v3.erase(v3.end()-1)=0
v3.erase(v3.end()-1); //{10, 10, 10, 1, 2, 3, 4, 5, 0}->{10, 10, 10, 1, 2, 3, 4, 5}
v3.erase(v3.begin(), v3.begin()+3); //{10, 10, 10, 1, 2, 3, 4, 5}->{1, 2, 3, 4, 5}

v2.clear(); //{0, 0, 0, 10, 10, 10}->{}

//#include  find();
vector<int>::iterator it = find(v3.begin(), v3.end(), 0);
if(it != v3.end()){
    //find it
}
else{
    //not found
}

//  
sort(v3.begin(), v3.end());// sort(v3.begin(), v3.end(), less());
//  
//#include greater()    , less()    
sort(v3.begin(), v3.end(), greater<int>());
//           
bool complare(int a,int b)
{
    return a>b;
}
sort(v3.begin(), v3.end(), complare);

bool complare(pair<int, int> l,pair<int, int> r)
{
    return l.first != r.first ? l.first < r.first : l.second > r.second;
}
//            ，         
vectorint, int>> vp{{1,1},{1,2},{2,2},{2,3},{3,3}};//{{1,1},{1,2},{2,2},{2,3},{3,3}}->{{1,2},{1,1},{2,3},{2,2},{3,3}}
sort(vp.begin(), vp.end(), complare);

//vector.swap(v)         
v1.swap(v3); // v1:{}->{5,4,3,2,1}, v3:{5,4,3,2,1}->{}
swap(v1[0], v1[1]);// v1:{5,4,3,2,1}->{4,5,3,2,1}