zoukankan      html  css  js  c++  java
  • STL-容器间的复制list&vector

    #include <iostream>
    #include <list>
    #include <string>
    #include <vector>
    
    int main()
    {
    	//copy list to list
    	std::list<std::string> oldList;
    	std::list<std::string> newList;
    	oldList.push_back("test1");
    	oldList.push_back("test2");
    	oldList.push_back("test3");
    	
    	std::copy(oldList.begin(), oldList.end(), std::back_inserter(newList));	
    
    	//copy vector to vector
    	std::vector<std::string> oldVector;
    	std::vector<std::string> newVector;
    	oldVector.push_back("test4");
    	oldVector.push_back("test5");
    	oldVector.push_back("test6");
    	std::copy(oldVector.begin(), oldVector.end(), std::back_inserter(newVector));	
    
    	//copy list to vector
    	std::list<std::string> list1;
    	std::vector<std::string> vector1;
    	list1.push_back("test7");
    	list1.push_back("test8");
    	list1.push_back("test9");
    	std::copy(list1.begin(), list1.end(), std::back_inserter(vector1));	
    
    	//copy vector to list
    
    	std::list<std::string> vector2;
    	std::vector<std::string> list2;
    	vector2.push_back("test10");
    	vector2.push_back("test11");
    	vector2.push_back("test12");
    	std::copy(vector2.begin(), vector2.end(), std::back_inserter(list2));	
    	return 0;
    }
    

  • 相关阅读:
    浅谈Tarjan算法及思想
    浅谈前向星
    线段树初步
    树状数组的简单运用
    字典树(trie树)的指针简单实现pascal
    排序专辑
    POJ 2155 Matrix (矩形)
    区间动态规划
    hdu-2795 Billboard---线段树
    hdu-1754 I Hate It---线段树模板题
  • 原文地址:https://www.cnblogs.com/hzcya1995/p/13318754.html
Copyright © 2011-2022 走看看