浠庝竴涓畝鍗曠殑闂寮濮嬶紝鍒犻櫎鏁扮粍涓煇涓厓绱犲悗榪炵畫(huà)閲嶅鐨勫厓绱狅紝渚嬪 1錛?錛?錛?錛?錛?錛?錛?錛?錛? ---> 1錛?2錛?錛?錛?錛?銆?br>
鑰冭檻浜?jiǎn)鍑牽U掞紝鐒跺悗灝卞紑濮嬪姩鎵嬪啓浠ｇ爜浜?jiǎn)锛?xì)
#include <iostream>#include <vector>using namespace std;int main(int argc, char* argv[])
{
int a[] = {1, 1, 3, 3, 3, 2, 4, 1, 1, 1, 0};
int size = sizeof(a)/sizeof(a[0]); vector<int> vec(a, a+size); vector<int>::iterator iter, end; int previous = vec[0]; for (iter = vec.begin() + 1, end = vec.end(); iter != end; ++iter) { if(*iter == previous) { vec.erase(iter);
} else { previous = *iter; } } for(iter = vec.begin(); iter != vec.end(); ++iter) { cout << *iter << endl; } return 0;
}鍙槸緙栬瘧涓涓嬶紝鍑烘潵涓澶у爢error錛屼粩緇嗙湅涓涓嬪嚭閿欎俊鎭紝鍝︼紝鍘熸潵鑷繁蹇樿浜?jiǎn)锛宔rase瀹瑰櫒涓厓绱犵殑鏃跺欙紝榪唬鍣ㄤ細(xì)澶辨晥銆傘傘傞】鏃朵竴韜喎姹楋紝鑷繁騫蟲(chóng)椂榪唬瀹瑰櫒鐨勬椂鍊欙紝涓鑸兘淇濆瓨?shù)簡(jiǎn)瀹瑰櫒鐨別nd鍏冪礌錛岃鏄鏃惰凱浠ｅ櫒澶辨晥銆傘傘?/p>
Container<int>::iterator iter, end;for (iter = container.begin() + 1, end = container.end(); iter != end; ++iter)
浜庢槸鎵懼埌鏀惰棌鐨凟ffective STL錛岀炕寮鏉℃9錛屾壘鍒頒簡(jiǎn)erase瀹瑰櫒涓厓绱犵殑鍘熷垯銆備互鍓嶆浘緇忕湅榪囷紝涓嶈繃騫存繁鏃ヤ箙錛屾棭灝卞繕寰椾竴騫蹭簩鍑浜?jiǎn)銆傜幇鍦ㄨ繕鏄妸瑕佺偣鎬葷粨涓涓嬶紝璁板湪blog涓婏紝渚涗互鍚庡弬鑰冦?br>
1. 瀵逛簬鍏寵仈瀹瑰櫒(濡俶ap, set, multimap,multiset)錛屽垹闄ゅ綋鍓嶇殑iterator錛屼粎浠呬細(xì)浣垮綋鍓嶇殑iterator澶辨晥錛屽彧瑕佸湪erase鏃訛紝閫掑褰撳墠iterator鍗沖彲銆傝繖鏄洜涓簃ap涔嬬被鐨勫鍣紝浣跨敤浜?jiǎn)绾㈤粦鏍?wèi)鏉ュ疄鐜幫紝鎻掑叆銆佸垹闄や竴涓粨鐐逛笉浼?xì)瀵瑰叾浠柧l撶偣閫犳垚褰卞搷銆?br>
for (iter = cont.begin(); it != cont.end();){ (*iter)->doSomething(); if (shouldDelete(*iter)) cont.erase(iter++); else ++iter;}鍥犱負(fù)iter浼犵粰erase鏂規(guī)硶鐨勬槸涓涓壇鏈紝iter++浼?xì)鎸囧悜涓嬩竴涓厓绱犮?br>
2. 瀵逛簬搴忓垪寮忓鍣?濡倂ector,deque)錛屽垹闄ゅ綋鍓嶇殑iterator浼?xì)鋴慑悗闈㈡墍鏈夊厓绱犵殑iterator閮藉け鏁堛傝繖鏄洜涓簐etor,deque浣跨敤浜?jiǎn)杩灳l垎閰嶇殑鍐呭瓨錛屽垹闄や竴涓厓绱犲鑷村悗闈㈡墍鏈夌殑鍏冪礌浼?xì)鍚戝墠绉诲姩涓涓綅緗傝繕濂絜rase鏂規(guī)硶鍙互榪斿洖涓嬩竴涓湁鏁堢殑iterator銆?br>
for (iter = cont.begin(); iter != cont.end();){ (*it)->doSomething(); if (shouldDelete(*iter)) iter = cont.erase(iter); else ++iter;}3. 瀵逛簬list鏉ヨ錛屽畠浣跨敤浜?jiǎn)涓崢q炵畫(huà)鍒嗛厤鐨勫唴瀛橈紝騫朵笖瀹冪殑erase鏂規(guī)硶涔熶細(xì)榪斿洖涓嬩竴涓湁鏁堢殑iterator錛屽洜姝や笂闈袱縐嶆柟娉曢兘鍙互浣跨敤銆?br>
鏈鍚庣粰鍑哄紑濮嬮偅涓棶棰樼殑涓涓紜殑瀹炵幇錛?/p>
#include <iostream>#include <vector>using namespace std;int main(int argc, char* argv[]){ int a[] = {1, 1, 3, 3, 3, 2, 4, 1, 1, 1, 0}; int size = sizeof(a)/sizeof(a[0]); vector<int> vec(a, a+size); vector<int>::iterator iter = vec.begin(); int previous = *iter; ++iter; for (; iter != vec.end();) { if(*iter == previous) { iter = vec.erase(iter); } else { previous = *iter; ++iter; } } for(iter = vec.begin(); iter != vec.end(); ++iter) { cout << *iter << endl; } return 0;}PS. 涓嶈繃瀹為檯涓婅繖涓棶棰橈紝鐢╲ector鏉ュ疄鐜頒笉鏄緢閫傚悎錛屽洜涓烘瘡嬈″垹闄や竴涓厓绱狅紝閮戒細(xì)寮曡搗vector鐨勪竴涓猺esize鎿嶄綔銆俽esize鐨勬椂闂村鏉傚害鏄疧(n)錛屾暣涓殑resize鎿嶄綔瑕佽姳璐筄(n^2)銆傛渶濂芥槸閫夋嫨list鏈涓哄鍣紝list鏈閫傚悎閭ｄ簺闇瑕佸湪瀹瑰櫒涓棿鍋氭彃鍏ャ佸垹闄ょ殑渚嬪瓙銆?br>
PS2. 鍙﹀涓涓彲鑳界殑鏂規(guī)硶鏄痳emove_if + erase鎯敤娉曘俽emove_if鐨勬椂闂村鏉傚害鏄疧(n). erase鐨勬椂闂村鏉傚害涔熸槸O(n)錛屾墍浠ユ暣涓搷浣滃彲浠ュ湪O(n)鏃墮棿閲屽畬鎴愩?褰撶劧錛屽浜庤繖涓緥瀛愶紝ShouldDeletePred姣旇緝闅懼啓)
iterator new_end = remove_if(array.begin(), array.end(), ShouldDeletePred());array.erase(new_end, array.end());]]>