c++ vector容器遍歷方式


#include <vector>
 #include <iostream>

class Test
{
public:
    int a;
    int b;
    int c;
    Test()
    {
         a = 0;
         b = 0;
         c = 0; 
     }
}

int main()
{
     vector<Test> vecTest;
    for(int i = 0; i < 5; i++)
    {
         Test temp;
         a=i;
         b=i+1;
         c=i+2;
         vecTest.push_back(temp);
    }  
    std::cout.setf(ios::left);
    std::cout.width(6);

    //一、通過數組下標遍歷
    for(int i = 0; i < vecTest.size(); i++)
    {
        std::cout << vecTest[i].a << vecTest[i].b << vecTest[i].c <<std::endl;
     }
  
    //二、通過迭代器遍歷
    for(vector<Test>::iterator iter = vecTest.begin();iter != vecTest.end();iter++)
    {
        std::cout << iter->a << iter->b << iter->c <<std::endl;
    }  

    //三、C++11標准,auto關鍵字遍歷
    for(auto iter = vecTest.begin(); iter != vecTest.end(); iter++)
    {
        std::cout << iter->a << iter->b << iter->c <<std::endl;
    }
   
    for(auto i : vecTest)
    {
         std::cout << iter->a << iter->b << iter->c <<std::endl;
    }
}

 


免責聲明!

本站轉載的文章為個人學習借鑒使用,本站對版權不負任何法律責任。如果侵犯了您的隱私權益,請聯系本站郵箱yoyou2525@163.com刪除。



 
粵ICP備18138465號   © 2018-2025 CODEPRJ.COM