#include <vector> vector<vector <int> > ivec(m ,vector<int>(n,value));
http://blog.csdn.net/hfengzhi/article/details/48474255
#include <vector> #include <iostream> using namespace std; typedef int date_type; void main_1() { int number=3,value=5; cout<<"please input number value:"<<endl; cin>>number>>value; //创建,初始值为0. //vector<date_type>v; //vector<date_type>v(number); vector<date_type>v(number,value); ////创建m*n的二维vector //vector<vector <int> > ivec; //ivec.resize(m,vector<int>(n)); ////m*n的二维vector,所有元素为0 //vector<vector <int> > ivec(m ,vector<int>(n,0)); //下标访问(同数组) //迭代器访问 vector<date_type>::iterator it; //定义迭代器变量 for(it=v.begin();it!=v.end();it++) { cout<<*it<<endl; } } /* please input number value: 3 6 6 6 6 请按任意键继续. . . */ void main() { int m,n,value; cout<<"please input number_m number_n value:"<<endl; cin>>m>>n>>value; ////创建m*n的二维vector //vector<vector <int> > ivec; //ivec.resize(m,vector<int>(n)); //m*n的二维vector,所有元素为0 vector<vector <int> > ivec(m ,vector<int>(n,value)); //下标访问(同数组) //迭代器访问 vector<vector <int> >::iterator it; //定义迭代器变量 for(it=ivec.begin();it!=ivec.end();it++) { vector <int> inner_vec=*it; vector <int>::iterator inner_it; for (inner_it=inner_vec.begin();inner_it!=inner_vec.end();inner_it++) { cout<<*inner_it<<" "; } cout<<endl; } } /* please input number_m number_n value: 2 3 4 4 4 4 4 4 4 请按任意键继续. . . */
void main() { int number=3,value=5; cout<<"please input number value:"<<endl; cin>>number>>value; vector<date_type>v(number,value); //下标访问(同数组) //迭代器访问 vector<date_type>::iterator it; //定义迭代器变量 for(it=v.begin();it!=v.end();it++) { cout<<*it<<endl; } cout<<"------------------"<<endl; for (int i=0;i<number;i++) { v[i]=i+1; } // for (int i=0;i<number;i++) { cout<<v[i]<<endl; } } /* please input number value: 5 3 3 3 3 3 3 ------------------ 1 2 3 4 5 请按任意键继续. . . */
int main() { vector<char> v1; vector<char>::iterator iter1; vector<char>::iterator iter2; v1.push_back('m'); v1.push_back('n'); v1.push_back('o'); v1.push_back('p'); cout << "v1.front() = " << v1.front() << endl; cout << "v1.back() = " << v1.back() << endl; iter1 = v1.begin(); cout << *iter1 << endl; iter2 = v1.end()-1; //注意v1.end()指向的是最后一个元素的下一个位置,所以访问最后一个元素 //的正确操作为:v1.end() - 1; cout << *iter2 << endl; v1.pop_back(); cout << "v1.back() = " << v1.back() << endl; return 0; } /* v1.front() = m v1.back() = p m p v1.back() = o 请按任意键继续. . . */
int main() { vector<char> v1; vector<char>::iterator iter1; vector<char>::iterator iter2; v1.push_back('m'); v1.push_back('n'); v1.push_back('o'); v1.push_back('p'); v1.insert(v1.begin()+1,'d');//在指针位置插入d v1.insert(v1.end()-2,'c');//在指针位置插入c int count=v1.size(); for (int i=0;i<count;i++) { cout<<v1[i]<<endl; } return 0; } /* m d n c o p 请按任意键继续. . . */
int main() { vector<char> v1; vector<char>::iterator iter1; vector<char>::iterator iter2; v1.push_back('m'); v1.push_back('n'); v1.push_back('o'); v1.push_back('p'); v1.erase(v1.begin()+1,v1.begin()+3);//删除区间,左闭右开 int count=v1.size(); for (int i=0;i<count;i++) { cout<<v1[i]<<endl; } v1.clear(); cout<<v1.size()<<endl; return 0; } /* m p 0 请按任意键继续. . . */
#include<algorithm> //自定义比较排序 bool cmp(int a,int b) { return a>b; } void main() { //反序 //reverse(v.begin()+n,v.begin()+m);//对两个指针间的数据进行反序 //快速排序 //sort(v.begin()+n,v.begin()+m);//对两个指针间的数据进行排序 //sort(v.begin()+n,v.begin()+m,cmp);//对两个指针间的数据进行排序 // int number=5; vector<date_type>v; v.push_back(5);v.push_back(3);v.push_back(4);v.push_back(1);v.push_back(2); //下标访问(同数组) //迭代器访问 vector<date_type>::iterator it; //定义迭代器变量 for(it=v.begin();it!=v.end();it++) { cout<<*it<<endl; } cout<<"------------------"<<endl; // reverse(v.begin(),v.end()); for (int i=0;i<number;i++) { cout<<v[i]<<endl; } cout<<"------------------"<<endl; // sort(v.begin(),v.end()); for (int i=0;i<number;i++) { cout<<v[i]<<endl; } cout<<"------------------"<<endl; // sort(v.begin(),v.end(),cmp); for (int i=0;i<number;i++) { cout<<v[i]<<endl; } cout<<"------------------"<<endl; } /* 5 3 4 1 2 ------------------ 2 1 4 3 5 ------------------ 1 2 3 4 5 ------------------ 5 4 3 2 1 ------------------ 请按任意键继续. . . */

浙公网安备 33010602011771号