//inta,b,c,d;
for(int i=0;i<4;i)
{cin>>a[i];
v.push_back(a[i]);}// 将带入向量
//v.push_back(b);
//v.push_back(c);
//v.push_back(d);
vector<int>::const_iterator i; //常量迭代器
for(i=v.begin();i!=v.end();i)
cout<<*i<<",";
cout<<endl;
vector<int>::reverse_iterator r; //反向迭代器
for(r=v.rbegin();r!=v.rend();r)
cout<<*r<<".";
cout<<endl;
vector<int>::iterator j; //非常量迭代器
for(j=v.begin();j!=v.end();j)
*j=100;
for(i=v.begin();i!=v.end();i)
cout<<*i<<".";
return 0;
}
输入:1 2 3 4
输出结果:1,2,3,4,
4.3.2.1.
100.100.100.100.
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main ()
{
int first[] = {5,10,15,20,25};
int second[] = {50,40,30,20,10};
vector<int> v(10);
vector<int>::iterator it;
sort (first,first5);
sort (second,second5);
it=set_union (first, first5, second, second5, v.begin());
cout << "union has " << int(it - v.begin())<< " elements.\n";
return 0;
}
输出结果:union has8 elements.
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(int argc, char** argv)
{
int A[] = {5,10,15,20,25};
int B[] = {50,40,30,20,10};
int C[10] = {0};
size_t size_A, size_B, size_C;
vector<int> v;
vector<int>::iterator it;
size_A = sizeof(A)/sizeof(A[0]);
size_B = sizeof(B)/sizeof(B[0]);
本文来自电脑杂谈,转载请注明本文网址:
http://www.pc-fly.com/a/jisuanjixue/article-34960-14.html
来战