본문 바로가기
728x90
반응형

프로그래밍 기록43

reverse #include #include using namespace std; void main() { int ari[]={1,2,3,4,5,6,7,8,9}; int i; for (i=0;i 2023. 12. 9.
sort #include #include #include using namespace std; void main() { int ari[]={2,8,5,1,9}; vector vi(&ari[0],&ari[5]); sort(vi.begin(),vi.end()); vector::iterator it; for (it=vi.begin();it!=vi.end();it++) { printf("%d\n",*it); } } 2023. 12. 9.
find #include #include #include #include using namespace std; void main() { int ari[]={1,2,3,4,5}; vector vi(&ari[0],&ari[5]); list li(&ari[0],&ari[5]); puts(find(vi.begin(),vi.end(),4)==vi.end() ? "없다.":"있다."); puts(find(li.begin(),li.end(),8)==li.end() ? "없다.":"있다."); puts(find(&ari[0],&ari[5],3)==&ari[5] ? "없다.":"있다."); } void main() { string names[]={"김씨","구씨","문씨", "김씨","임씨","영씨","박씨"}; vector a.. 2023. 12. 9.
itergeneric #include #include #include using namespace std; template void Print(IT s, IT e) { IT it; for (it=s;it!=e;it++) { printf("%d\n",*it); } } void main() { int ari[]={1,2,3,4,5}; vector vi(&ari[0],&ari[5]); list li(&ari[0],&ari[5]); Print(&ari[0],&ari[5]); Print(vi.begin(),vi.end()); Print(li.begin(),li.end()); } 2023. 12. 9.
itervector #include #include using namespace std; void main() { int ari[]={1,2,3,4,5}; vector vi(&ari[0],&ari[5]); vector::iterator it; for (it=vi.begin();it!=vi.end();it++) { printf("%d\n",*it); } } 2023. 12. 8.
iterarray #include using namespace std; void main() { int ari[]={1,2,3,4,5}; int *it; for (it=&ari[0];it!=&ari[5];it++) { printf("%d\n",*it); } } 2023. 12. 8.
728x90
반응형