#include<iostream>
#include<vector>
#include<list>
#include<deque>
#include<iterator>
#include<algorithm>
using namespace std;
/*
int main()
{
vector<int> V;
V.push_back(10);
V.push_back(20);
V.push_back(30);
V.push_back(40);
vector<int>::iterator itBegin = V.begin();
vector<int>::iterator itEnd = V.end();
while (itBegin != itEnd)
{
cout << *itBegin << endl;
itBegin++;
}
system("pasue");
}
*/
/*
int main()
{
vector<int> V;
V.push_back(10);
V.push_back(20);
V.push_back(30);
V.push_back(40);
for (vector<int>::iterator it = V.begin();it != V.end();it++)
cout << *it << ' ';
getchar();
}
*/
/*
void fun(int val)
{
cout << val << ' ';
}
int main()
{
vector<int> V;
V.push_back(10);
V.push_back(20);
V.push_back(30);
V.push_back(40);
for_each(V.begin(), V.end(), fun);
system("pause");
}
*/
C++迭代器常用三种遍历方法
最新推荐文章于 2025-03-18 17:45:30 发布