迭代器

#include <iostream>
#include <deque>
#include <vector>
#include <list>

using namespace std;

int main()
{
	vector<int> a;
	deque<int> b;
	list<int> c;

	a.push_back(1);
	a.push_back(2);
	a.push_back(3);

	vector<int>::iterator iter1 = a.begin();
	vector<int>::iterator iter2 = a.end();  // end是指向最后一个的下一个，

	cout << *iter1 << endl; // 输出1，
	iter1++;
	cout << *iter1 << endl;  // 输出2，
	cout << endl << endl;

	vector<int>::iterator first = a.begin();
	vector<int>::iterator last = a.end();
	while (first != last)
	{
		cout << *first << endl;
		first++;
	}
	vector<int>::iterator x = a.begin();
	vector<int>::iterator y = x + a.size()/2;  //中间，

	cout << "中间" << *y << endl;


	return 0;
}