顺序容器

#include <iostream>
#include <deque>
#include <vector>
#include <list>
#include "Dog.h"
#include "Cat.h"
#include <string>

using namespace std;

int main()
{
	vector<string> svec;// 默认的构造函数，
	svec.push_back("hello");
	svec.push_back("C++");
	svec.push_back("xiao cui");

	list<int>     ilist;
	vector<Dog>  dogvec;
	list<Cat>   catlist;

	vector<int> ivec;  // 默认的构造函数，
	ivec.push_back(2);
	ivec.push_back(3);

	vector<int> ivec2(ivec); // 用第一个函数ivec初始化第二个构造函数ivec2，

	list<string> slist(svec.begin(), svec.end());//利用迭代器初始化不同的类，
	vector<string>::iterator mid = svec.begin() + svec.size() / 2;//利用迭代器初始化不同的类，
	deque<string> front(svec.begin(), mid); //利用迭代器初始化不同的类，

	char *words[] = { "a","b","c","d"};
	size_t words_size = sizeof(words) / sizeof(char *);
	list<string> words2(words, words + words_size);

	cout << slist.front() << endl;

	return 0;
}