一个vector保持1-9将其拷贝到其他容器中,分别使用inserter,back_inserter和front_inserter将元素添加到三个容器中,对每一种inserter,估计输出序列是怎样子...

int main() {
	

	vector<int>v1 = { 1,2,3,4,5,6,7,8,9 };
	list<int>lst1;
	deque<int>dq;
	forward_list<int> fst;
	copy(v1.cbegin(), v1.cend(), front_inserter(fst));
	copy(v1.cbegin(), v1.cend(), back_inserter(dq));
	copy(v1.cbegin(), v1.cend(), inserter(lst1, lst1.begin()));

	for (int i : lst1) {
		cout << i << endl;
	}
	cout << "--------END------------"<<endl;
	for (int i : dq) {
		cout << i << endl;
	}
	cout << "--------END------------" << endl;
	for (int i : fst) {
		cout << i << endl;
	}
	cout << "--------END------------" << endl;
	return 0;
}

　　

转载于:https://www.cnblogs.com/lIllIll/p/10806906.html