::public/C++63 STL algorithmn ;find #include vector v; v.push_back(1); v.push_back(2); vector::iterator iter; iter = find(v.begin(), v.end(), 1); if (iter != v.end()) cout 2019. 6. 13. STL iterator #include ;iterator vector v; deque d(10, 1); copy(d.begin(), d.end(), back_inserter(v)); // back_inserter 반복자 사용 vector::iterator iter; for (iter = v.begin(); iter != v.end(); ++iter) cout 2019. 6. 13. STL container 생각나지 않을때 보자.(링크 걸림) array deque forword_list list map queue set stack unordered_map unordered_set vector 2019. 6. 12. 이전 1 ··· 8 9 10 11 다음