setの使い方
#include<stdio.h> #include<stdlib.h> #include<iostream> #include<set> #include<map> #include<vector> #include<algorithm> #include<math.h> int main(){ using namespace std; std::set<int> nodelist; int i; int nodeno=10; for(i=0;i<nodeno;i++){ nodelist.insert(i); } nodelist.erase(nodelist.find(2)); nodelist.erase(nodelist.find(3)); nodelist.erase(nodelist.find(4)); nodelist.erase(nodelist.find(5)); nodelist.erase(nodelist.find(7)); set<int>::iterator it = nodelist.begin(); while(it != nodelist.end()){ cout << *it << endl; ++it; } }