摘要：
#include<iostream>//#include<list.h>#include<iterator>#include<vector>#include<string>using namespace std;void main(){ string s1[4]={"fine","fish","fashion","fate"}; string s2[2]={"busy","bate"}; string s3[3]={ 阅读全文
摘要：
#include<iostream>#include<algorithm>#include<deque>#include<string>//#include <vector>#include <map>//#include <set>using namespace std;void main(){ deque<char>a; for(int i=0;i<5;a.push_back('5'-i++)); cout<<"size::"<< 阅读全文
摘要：
#include<iostream>#include<iterator>#include<vector>using namespace std;void main(){ int a[10]={6,7,2,9,4,11,8,7,10,5}; vector<int>b(10); copy(a,a+10,b.begin()); cout<<"let the b be a!\n"; ostream_iterator<int,char>out(cout," "); copy(b.begin() 阅读全文
摘要：
#include<iostream>#include<string>using namespace std;void main(){ string s1,s2="6";int s3;cin>>s1;cout<<"s1::"<<s1<<endl;getline(cin,s2,'x');cout<<"s2::"<<s2<<"%%%"<<endl;//getline(cin,s3);} 阅读全文
摘要：
//队列的链式存储结构(还没写遍历）==============#include<iostream>using namespace std;typedef struct qnode{ int data; struct qnode *next ;}qnode,*queueptr;typedef struct{ queueptr front; queueptr rear;}linkqueue;///////////////////int initqueue(linkqueue &q){ q.front=q.rear=(queueptr)malloc (sizeof(qnode) 阅读全文
摘要：
#include<iostream>using namespace std;void main(){ int a=5,b=6;int i,j;int **c = new int*[b]; for( i=0;i<b;i++) c[i] = new int[a]; //使用时用 arData[i][j]格式 0 <=i <nHeight, 0 <=j <nWidth //结束时清除 cout<<c<<endl;for(i=0;i<b;i++) for(j=0;j<a;j++) c[i][j]=i+j;for(i=0;i& 阅读全文
摘要：
#include<iostream>using namespace std;typedef struct qnode{ int data; struct qnode *next ;}qnode,*queueptr;typedef struct{ queueptr front; queueptr rear;}linkqueue;///////////////////int initqueue(linkqueue &q){ q.front=q.rear=(queueptr)malloc (sizeof(qnode)); if(!q.front) return 0; q.fron 阅读全文