vector list unordered_map queue 遍历

vector遍历

vector<int> v{ 1,2,3,4,5 };
	//新特性遍历
	for (auto & p : v) {
		cout << p ;
	}
	cout << endl;
	//下标遍历
	for (int i = 0; i < v.size(); i++) {
		cout << v[i];
	}
	cout << endl;
	//迭代器遍历
	for (vector<int> ::iterator it = v.begin(); it != v.end(); ++it) {
		cout << *it ;
	}
	cout << endl;

list遍历

list<int> li{ 1,2,3,4,5 };
	//新特性遍历
	for (auto &p : li) {
		cout << p;
	}
	cout << endl;

	//cout << li[0] << endl;不可以下标访问

	//迭代器遍历
	for (list<int> ::iterator it = li.begin(); it != li.end(); it++) {
		cout << *it;
	}
	cout << endl;

unordered_map 遍历

unordered_map<char, int> mm;
	mm['a'] = 10, mm['b'] = 20;
	//新特性遍历
	for (auto & p : mm) {
		cout << p.first << "  " << p.second << endl;
	}
	//利用first遍历
	cout << mm['a'] << "  " << mm['b'] << endl;
	//迭代器遍历
	for (unordered_map<char, int> ::iterator it = mm.begin(); it != mm.end(); it++) {
		cout << it->first << "  " << it->second << endl;
	}

queue遍历

	//先进先出
	queue<int> myqueue;
	myqueue.push(1);
	myqueue.push(2);
	myqueue.push(3);

	for (int i = 0; i < myqueue.size(); i++) { 
		cout << myqueue.front() << endl;
		myqueue.push(myqueue.front());
		myqueue.pop();
	}