TOP API C++
remove
remove_if
unique
merge
sort
reverse
#include <iostream> #include <list> using namespace std; int main (){ list<int> mylist; mylist.push_back(10); while (mylist.back() != 0) { mylist.push_back ( mylist.back() -1 ); } cout << "size: " << (int) mylist.size() << endl; cout << "mylist:"; for (list<int>::iterator it=mylist.begin(); it!=mylist.end() ; ++it){ cout << " " << *it; } cout << endl; mylist.push_front (300); cout << "mylist.front(): " << mylist.front() << endl; list<int>::iterator it; it = mylist.begin(); ++it; mylist.insert (it,10); mylist.insert (it,2,20); --it; vector<int> myvector (2,30); mylist.insert (it,myvector.begin(),myvector.end()); it1 = mylist.erase (it1); //mylist.erase (it1,it2); while (!mylist.empty()) { sum += mylist.front(); mylist.pop_front(); } cout << "total: " << sum << endl; list<int> first; list<int> second; first.assign (7,100); second.assign (first.begin(),first.end()); first.swap(second); int myints[]={12,234,4567}; first.assign (myints,myints+3); // assigning from array cout << "Size of first: " << int (first.size()) << endl; cout << "Size of second: " << int (second.size()) << endl; first.clear(); second.clear(); while (!mylist.empty()) { cout << " " << mylist.front(); mylist.pop_front(); } return 0; }splice
remove
remove_if
unique
merge
sort
reverse
最新コメント