[C++]STLまとめ(一)vector
14213 ワード
[C++]STLまとめ(一)vector
#include
#include //vector
#include
#include
using namespace std;
int main()
{
// vector
vector<int> V1;
vector<int> V2(10);//vector 10 0
vector<double> V3(10,1.5);//10 1.5
vector<double> V4(V3);//
vector<int>*pa=new vector<int>(10,1.5);//
V1.push_back(1);//
V1.push_back(2);
V1.insert(V1.begin(),0);// V1.begin()
V1.insert(V1.end(),4);//
V1.insert(V1.end()-1,3);
for(int i=0;i<V1.size();i++)//V1.size()
cout<<V1[i]<<" ";//
cout<<endl;
V1.resize(6,1);//V1.resize(6,1)
for(int i=0;i<V1.size();i++)
cout<<V1[i]<<" ";
cout<<endl;
V1.pop_back();// ;
V1.erase(V1.begin());//
V1.erase(V1.begin(),V1.end());//
// V1.clear()
//V1.size()
//V1.capacity()= [ - V1.size()]
//V1.max_size()
//V1.empty()
//V1.resize(n)
//V1.resize(n,t) t
//VECTOR
vector<int>::iterator it;
//*it=5;
//++it,it++ it+i;
//--it,it-- it-i;
// ,>=,==,!=; it1
//it.V1.begin() V1[0]; it.V1.end()
// begin end
for(int i=0;i<10;i++)
V1.push_back(i);
for(it=V1.begin();it<V1.end();it++)
if(*it%2==0) cout<<*it<<" "; //it
//V1.insert(p,t) p t
//V1.insert(p,n,t) p n t
//V1.insert(p,b,e) p b e
//V1.erase(p) p
//V1.erase(b,e) b e
for(it=V1.begin();it<V1.end();)
if(*it%2==0) it=V1.erase(it);//V1.erase(it)
else it++;//
//vector ( ) algorithm numeric
//find(V1.begin()+i,V1.end()-i,val) val end();
//sort(begin,last) ;
//merge(f1,e1,f2,e2,p) f1,e1,f2,e2,p
// V1 [f1,e1) V2[f2,e2) , p
// //
//replace(first,last,old,new) [first,last) old new
//reverse(start,end) [start,end)
//count(start,end,val) [start,end) =val
//accumulate(first,last,init) [start,end) , init
}