代码如下:
#define _SCL_SECURE_NO_WARNINGS
#include <vector>
#include <iostream>
#include <functional>
#include <algorithm>
#include <windows.h>
using namespace std;
void fun(int i){
cout << i << " ";
}
int main(){
vector<int> vec;
for (int i = 0; i < 10; i++)
vec.push_back(i);
vec.insert(vec.begin() + 2, 999);
for_each(vec.begin(), vec.end(), fun);
cout << endl;
vec.insert(vec.begin() + 2, 5, 887);
for_each(vec.begin(), vec.end(), fun);
cout << endl;
vector<int> vec1(5, 1);
vec.insert(vec.end(), vec1.begin(), vec1.end());
for_each(vec.begin(), vec.end(), fun);
cout << endl;
vec.pop_back();
for_each(vec.begin(), vec.end(), fun);
cout << endl;
vec.erase(vec.begin() + 3);
for_each(vec.begin(), vec.end(), fun);
cout << endl;
vec.erase(vec.begin() + 3, vec.end());
for_each(vec.begin(), vec.end(), fun);
cout << endl;
//修改
vector<int>::iterator ite = vec.begin();
for (; ite != vec.end(); ite++){
*ite = 999;
}
for_each(vec.begin(), vec.end(), fun);
cout << endl;
//交换
vector<int> vecc(5, 77);
vec.swap(vec1);
for_each(vec.begin(), vec.end(), fun);
cout << endl;
//算法
vector<int> veca;
veca.push_back(9);
veca.push_back(5);
veca.push_back(6);
veca.push_back(8);
veca.push_back(7);
veca.push_back(1);
for_each(veca.begin(), veca.end(), fun);
cout << endl;
sort(veca.begin(), veca.end());
for_each(veca.begin(), veca.end(), fun);
cout << endl;
sort(veca.begin(), veca.end(), greater<int>());
for_each(veca.begin(), veca.end(), fun);
cout << endl;
system("pause");
return 0;
}
运行结果如下: