// back、rbegin 有常量和引用兩種形式     std::vector<int> myVector;     myVector.back()=3;        std::vector<int>::reverse_iterator tailIter;     tailIter=myVector.rbegin();     *tailIter=3 

#include <vector> #include <iostream>  int main( ) {   using namespace std;     vector <int> v1;   vector <int>::iterator Iter;      v1.push_back( 10 );   v1.push_back( 20 );   v1.push_back( 30 );   v1.push_back( 40 );   v1.push_back( 50 );    cout << "v1 =" ;   for ( Iter = v1.begin( ) ; Iter != v1.end( ) ; Iter++ )    cout << " " << *Iter;   cout << endl;    v1.erase( v1.begin( ) );   cout << "v1 =";   for ( Iter = v1.begin( ) ; Iter != v1.end( ) ; Iter++ )    cout << " " << *Iter;   cout << endl;    v1.erase( v1.begin( ) + 1, v1.begin( ) + 3 );   cout << "v1 =";   for ( Iter = v1.begin( ) ; Iter != v1.end( ) ; Iter++ )    cout << " " << *Iter;   cout << endl; } 

v1 = 10 20 30 40 50v1 = 20 30 40 50v1 = 20 50

//delNode.vectorNode 是與delPositionVector同類型容器 // vector 兩容器不能直接賦值 可通過 遍歷每個(gè)元素賦值，也可使用 assign賦值  VectorNode delNode;  delNode.numberOfFenkuai=nSelect; Node nodeTemp; 

// 這是錯(cuò)誤的賦值方式   delNode.vectorNode=delPositionVector ; 

for (int i=0;i<delPositionVector.size();i++) {   nodeTemp=delPositionVector.at(i);   delNode.vectorNode.push_back(nodeTemp); } 

delNode.vectorNode.assign(delPositionVector.begin(),delPositionVector.end()); 

iterator insert(  iterator _Where,  const Type& _Val);void insert(  iterator _Where,  size_type _Count,  const Type& _Val);template<class InputIterator>   void insert(   iterator _Where,   InputIterator _First,   InputIterator _Last  );  

delNode.vectorNode.assign(delPositionVector.begin(),delPositionVector.end()); BOOL bInsert=FALSE; std::vector <VectorNode>::iterator iter; for (iter=g_DelVector.begin();iter!=g_DelVector.end();iter++) {   if ((*iter).numberOfFenkuai==nSelect)   {     bInsert=TRUE;     //g_DelVector.erase(iter);     //g_DelVector.insert(iter,delNode);     iter=g_DelVector.insert(iter,delNode);     iter=g_DelVector.erase(iter+1);     iter--;     break;   } }   if (!bInsert) {   g_DelVector.push_back(delNode); } 

std::vector<int> vNum; vNum.push_back(1); vNum.push_back(3); vNum.push_back(5); std::vector<int>::iterator pIt = vNum.begin(); std::cout << "Before insert a new number: " << *pIt << std::endl; vNum.push_back(7); std::cout << "After insert a new number: " << *pIt << std::endl;  // Oh! No! 

std::map<int, int> mNum; mNum[0] = 0; mNum[1] = 1; mNum[2] = 2; std::map<int, int>::iterator pIt = mNum.begin(); std::cout << "Before insert a new number: (" << pIt->first << ", " << pIt->second << ")" << std::endl; mNum[3] = 3; std::cout << "After insert a new number: (" << pIt->first << ", " << pIt->second << ")" << std::endl; // OK! 

std::vector<line>::iterator i1 = v1.begin(), i2 = v2.begin(); while(i1 != v1.end() && i2 != v2.end()) {   if(i1->index == i2->index)   {     line t = { i1->index, i1->value1, i2->value2 }     v3.push_back(t);     ++i1;     ++i2;   }   else if(i1->index > i2->index)   {     i2->value1 = 0;     v3.push_back(*i2);     ++i2;   }   else   {     i1->value2 = 0;     v3.push_back(*i1);     ++i1;   } }  while(i1 != v1.end())   v3.push_back(*(i1++));  while(i2 != v2.end())   v3.push_back(*(i2++)); 

// alg_sort.cpp // compile with: /EHsc #include <vector> #include <algorithm> #include <functional>   // For greater<int>( ) #include <iostream>  // Return whether first element is greater than the second bool UDgreater ( int elem1, int elem2 ) {   return elem1 > elem2; }  int main( ) {   using namespace std;   vector <int> v1;   vector <int>::iterator Iter1;    int i;   for ( i = 0 ; i <= 5 ; i++ )   {    v1.push_back( 2 * i );   }    int ii;   for ( ii = 0 ; ii <= 5 ; ii++ )   {    v1.push_back( 2 * ii + 1 );   }    cout << "Original vector v1 = ( " ;   for ( Iter1 = v1.begin( ) ; Iter1 != v1.end( ) ; Iter1++ )    cout << *Iter1 << " ";   cout << ")" << endl;    sort( v1.begin( ), v1.end( ) );   cout << "Sorted vector v1 = ( " ;   for ( Iter1 = v1.begin( ) ; Iter1 != v1.end( ) ; Iter1++ )    cout << *Iter1 << " ";   cout << ")" << endl;    // To sort in descending order. specify binary predicate   sort( v1.begin( ), v1.end( ), greater<int>( ) );   cout << "Resorted (greater) vector v1 = ( " ;   for ( Iter1 = v1.begin( ) ; Iter1 != v1.end( ) ; Iter1++ )    cout << *Iter1 << " ";   cout << ")" << endl;    // A user-defined (UD) binary predicate can also be used   sort( v1.begin( ), v1.end( ), UDgreater );   cout << "Resorted (UDgreater) vector v1 = ( " ;   for ( Iter1 = v1.begin( ) ; Iter1 != v1.end( ) ; Iter1++ )    cout << *Iter1 << " ";   cout << ")" << endl; } 

Original vector v1 = ( 0 2 4 6 8 10 1 3 5 7 9 11 ) Sorted vector v1 = ( 0 1 2 3 4 5 6 7 8 9 10 11 ) Resorted (greater) vector v1 = ( 11 10 9 8 7 6 5 4 3 2 1 0 ) Resorted (UDgreater) vector v1 = ( 11 10 9 8 7 6 5 4 3 2 1 0 ) 

m_itemVector.clear(); 

vector<ITEM_CHECK>::iterator iter=m_itemVector.begin(); for(i=0;iter!=m_itemVector.end();iter++,i++) {   if(iter->flag==-1)   {     break;   }   iter->flag=1; } vector<ITEM_CHECK>::iterator iter=m_itemVector.begin(); for(i=0;iter!=m_itemVector.end();iter++,i++) //先全部取消 {   iter->flag=0; } 

int CurrentCount=(int)m_itemVector.size(); for(int i=0;i<CurrentCount;i++) {   if(m_itemVector.at(i).flag==1)   {     m_itemVector.erase(m_itemVector.begin()+i);     DeleteItem(i);     this->Invalidate();       CurrentCount--;     i--;                        //刪除第i位置后，需要重新判斷第i位置是否符合條件，因此需要i--。   } } 

vector<ITEM_CHECK>::iterator iter=m_itemVector.begin(); for(i=0;iter!=m_itemVector.end();iter++,i++) //先全部取消 {   iter->flag=0; }  for (;i>0;)            //從后往前設(shè)置 iter 退到Begin() 再減的話 就會(huì)出現(xiàn)問題 {    iter--; //結(jié)束時(shí)，正好退到Begin()   i--;   iter->flag=1; } 

#include<vector> #include<algorithm> //在VECTOR中查找 using namespace std; vector<int> L; L.push_back( 1 ); L.push_back( 2 ); L.push_back( 3 ); L.push_back( 4 ); L.push_back( 5 ); vector<int>::iterator result = find( L.begin( ), L.end( ), 3 ); //查找3 if ( result == L.end( ) ) //沒找到   cout << "No" << endl; else //找到   cout << "Yes" << endl;