#include<iostream>
#include<cstring>
#include<vector>
#include<math.h>
std::vector<int> v;
using namespace std;
int main(int argc, char const *argv[])
{
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
v.push_back(5);
v.erase(v.begin()+1);//删除2
v.erase(v.begin()+2,v.begin()+3);// 删除4
std::vector<int>::iterator ite;
for(ite=v.begin();ite!=v.end();ite++)
cout<<*ite<<" ";
cout<<endl;
return 0;
}
如果是二维的链表
也可以edge[1].erase(edge[1].begin()+1,edge[1].begin()+1+i);来删除