zoukankan      html  css  js  c++  java
  • vector swap

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


    using namespace std;


    int main()
    {
      vector<int> a;
      vector<int> b;

      a.push_back(10);
      a.push_back(20);
      a.push_back(30);
      a.push_back(40);

      b.push_back(100);
      b.push_back(200);
      b.push_back(300);


      vector<int>::iterator a_iter;
      vector<int>::iterator b_iter;

      for (a_iter =a.begin();a_iter !=a.end();a_iter++)
      {
        cout << *a_iter<< endl;
      }
      cout << "-------------------------------" << endl;
      for (b_iter = b.begin(); b_iter != b.end(); b_iter++)
      {
        cout << *b_iter << endl;
      }

      cout << "-------------------------------" << endl;
      a.swap(b);


      vector<int>::iterator a_iter2;
      vector<int>::iterator b_iter2;

      for (a_iter2 = a.begin(); a_iter2 != a.end(); a_iter2++)
      {
        cout << *a_iter2 << endl;
      }
      cout << "-------------------------------" << endl;
      for (b_iter2 = b.begin(); b_iter2 != b.end(); b_iter2++)
      {
        cout << *b_iter2 << endl;
      }

      cout << "-------------------------------" << endl;


      system("pause");
      return 0;
    }

    ====================================================

    10
    20
    30
    40
    -------------------------------
    100
    200
    300
    -------------------------------
    100
    200
    300
    -------------------------------
    10
    20
    30
    40
    -------------------------------
    请按任意键继续. . .

  • 相关阅读:
    纯js实现字符串formate方法
    C#实现json压缩和格式化
    简单的前端校验框架实现
    快速拷贝文件
    0012 移除元素
    0011 删除链表的倒数第N个节点
    0010 最长公共前缀
    0009 合并两个有序链表
    0008 合并K个排序链表
    0007 回文数
  • 原文地址:https://www.cnblogs.com/herd/p/10993817.html
Copyright © 2011-2022 走看看