首先，給大家一個c++在線文檔系統 c++在線文檔 我不喜歡過多的解釋，我覺得通過寫代碼與實踐才能真正的理解程序設計。
#include<vector>#include<iostream>using namespace std;int main(){ vector<int> vec; int array[5]={0,1,2,3,4}; for(int index = 0 ; index < 5 ; index++) vec.push_back(array[index]); for(int index = 0 ; index < vec.size() ; index++) cout<<vec[index]<<" "; cout<<endl; vec.insert(vec.begin()+4,4); for(int index = 0 ; index < vec.size() ; index++) cout<<vec[index]<<" "; cout<<endl; vec.erase(vec.begin()+4); for(int index = 0 ; index < vec.size() ; index++) cout<<vec[index]<<" "; cout<<endl; vec.clear(); cout<<vec.size(); return 0;} /*1.頭文件 <vector>2.創建對象 vector<type> name3.尾部插入 .push_back4.插入元素 .erase(v.begin() + i , number) 在第i+1之前插入元素5.刪除元素。erase(v.begin() + i) 刪除第i+1個元素6.刪除區間 .erase(v.begin() + i,v.begin() + j)刪除區間[i,j]7.向量大小： .size();8.清空 .clear(); */ #include<vector>#include<iostream>#include<algorithm>using namespace std;bool comb(int a, int b) { return a > b;}int main() { vector<int> vec; int array[5] = { 5,2,1,4,3 }; for (int index = 0; index < 5; index++) vec.push_back(array[index]); reverse(vec.begin(), vec.end()); for (int index = 0; index < vec.size(); index++) cout << vec[index] << " "; cout << endl; sort(vec.begin(), vec.end()); for (int index = 0; index < vec.size(); index++) cout << vec[index] << " "; cout << endl; sort(vec.begin(), vec.end(),comb); for (int index = 0; index < vec.size(); index++) cout << vec[index] << " "; cout << endl;}//使用reverse(v.begin(),v.end())實現反轉//sort(vec.begin(),vec.end())實現排序，默認從小到大//通過自定義排序標準comb實現自定義排序，同樣，這個很適用于結構體排序#include<vector>#include<iostream>using namespace std;int main() { vector<int> vec(10, 1); vec.push_back(2); for (int index = 0 ;index < vec.size(); index++) cout << vec[index] << " "; cout << endl; int array[6] = { 1,2,3,4,5,6 }; vector<int> vec1(array+2, array + 6); vec1 = vec; for (int index = 0; index < vec1.size(); index++) cout << vec1[index] << " "; cout << endl;}/*1.vector<int> vec(size,initialValue);2.vector<int> vec2(array+j,array+i)初始化時復制數組[j-1,i-1]區間4.vector之間可以相互賦值。*/#include<iostream>#include<vector>using namespace std;int main(){ int array[5]={1,2,3,4,5}; vector<int> vec(array,array+5); if((!vec.empty())){ for(int index = 0 ; index < vec.size(); index++) cout<<vec[index]<<" "; cout<<endl; for(vector<int>::iterator iter = vec.begin() ; iter != vec.end() ; iter++) { cout<<(*iter)<<" "; } cout<<endl; for(vector<int>::const_iterator iter = vec.cbegin() ; iter != vec.cend() ; iter++) { cout<<(*iter)<<" "; } cout<<endl; for(auto iter = vec.cbegin() ; iter != vec.cend() ; iter++) cout<<(*iter)<<" "; cout<<endl; } return 0;}//用迭代器等方法實現遍歷//使用empty函數判斷是否非空 //以上是我覺得使用頻率較高的，對于其他用法，在以后的博客會進行補充。
新聞熱點
疑難解答
圖片精選
