zoukankan      html  css  js  c++  java
  • C++ vector 多次删除第一个元素

    转载声明:  代码都是来源于一下连接,做了一点点修改,为了记忆方便,故贴在这里,原文链接:
    http://blog.csdn.net/doctor_feng/article/details/11880787

    ////test cpp operation // //#include<vector> //#include<stdio.h> //using namespace std; //typedef struct { // int id; // int name; //}Student; // // // //int main() { // Student ss = {12,13}; // printf("%d %d ", ss.id, ss.name); // vector<Student> st; // //struct 初始化 // vector<Student> s(2,{12,13}) ; // s(2, ss); // s.push_back(ss); // // // // int i = 1; // // while(i < 10) { // printf("%d, %d", s.front().id, s.front().name); // // i++; // } //} #include <iostream> #include <vector> #include <algorithm> #include <string> #include <list> using namespace std; voidPrintInt(const int&nData) { cout<<nData<<endl; } int main() { vector<int> vecInt; for(int i=0; i<10;++i) { vecInt.push_back(i); } cout<<"向量中的内容为:"<<endl; //for_each(vecInt.begin(),vecInt.end(),PrintInt); for(vector<int>::iterator iter = vecInt.begin(); iter != vecInt.end(); ++iter) { cout << *iter << " "; } cout << " "; cout<<"vector contains "<<vecInt.size()<<" elements"<<endl; vecInt.pop_back();//删除最后一个元素 cout<<"删除最后一个元素后,vector contains "<<vecInt.size()<<" elements"<<endl; vector<int>::iterator k = vecInt.begin(); vecInt.erase(k);//删除第一个元素 for(vector<int>::iterator iter = vecInt.begin(); iter != vecInt.end(); ++iter) { cout << *iter << " "; } cout << " "; //vecInt.erase(k); //迭代器k已经失效,会出错 cout<<"删除第一个元素后,vector contains "<<vecInt.size()<<" elements"<<endl; k = vecInt.begin(); vecInt.erase(k); for(vector<int>::iterator iter = vecInt.begin(); iter != vecInt.end(); ++iter) { cout << *iter << " "; } cout << " "; cout<<"删除第一个元素后,vector contains "<<vecInt.size()<<" elements"<<endl; //vecInt.erase(vecInt.begin(),vecInt.end()); //删除所有元素 //cout<<"删除所有元素后,vector contains "<<vecInt.size()<<"elements"<<endl; //输出为0 vector<int>::iterator vecNewEnd =remove(vecInt.begin(),vecInt.end(),5); //删除元素 cout<<"删除元素后,vector contains "<<vecInt.size()<<" elements"<<endl; cout<<"向量开始到新结束为止的元素:"<<endl; //for_each(vecInt.begin(),vecNewEnd,PrintInt); cout<<"向量中的元素:"<<endl; //for_each(vecInt.begin(),vecInt.end(),PrintInt); return 0; }

      

  • 相关阅读:
    LightOJ 1344 Aladdin and the Game of Bracelets
    CF 1132A,1132B,1132C,1132D,1132E,1132F(Round 61 A,B,C,D,E,F)题解
    CF 1130A 1130B 1130C1129A1 1129A2 1129B(Round542A B C D1 D2 E)题解
    CF 1131A,1131B,1131C,1131D,1131F(Round541 A,B,C,D,F)题解
    CoderForces-Round60D(1117) Magic Gems
    CoderForces Round60-(1117A,1117B,1117C题解)
    LightOJ 1038 Race To 1 Again(概率DP)
    XHXJ'S LIS(数位DP)
    CF 55D Beautiful Numbers(数位DP)
    LightOJ 1229 Tablecross
  • 原文地址:https://www.cnblogs.com/robin2ML/p/7719002.html
Copyright © 2011-2022 走看看