List中remove()方法的陷阱,被坑慘了!
閱讀本文大概需要 4 分鐘。
來自:blog.csdn.net/pelifymeng2/article/details/78085836
list.remove(o)/remove(i)方法。在使用時,容易觸碰陷阱,得到意想不到的結果??偨Y以往經驗,記錄下來與大家分享。package?com.cicc.am.test;
?
import?java.util.ArrayList;
import?java.util.List;
?
public?class?ListTest?{
?
?public?static?void?main(String[]?args)?{
??List?list=new?ArrayList ();
??list.add(1);
??list.add(2);
??list.add(3);
??list.add(3);
??list.add(4);
??System.out.println(list);
?}
}
錯誤!?。?/strong>for(int?i=0;i
???if(list.get(i)==3)?list.remove(i);
}
System.out.println(list);
正確!for(int?i=0;i
???if(list.get(i)==3)?list.remove(i--);
}
System.out.println(list);
正確!for(int?i=list.size()-1;i>=0;i--){
?if(list.get(i)==3){
??list.remove(i);
?}
}
System.out.println(list);
錯誤?。?!for(Integer?i:list){
????if(i==3)?list.remove(i);
}
System.out.println(list);
java.util.ConcurrentModificationExceptionList.iterator()源碼著手分析,跟蹤iterator()方法,該方法返回了 Itr 迭代器對象。??public?Iterator
?iterator()? {
????????return?new?Itr();
????}
private?class?Itr?implements?Iterator<E>?{
????????int?cursor;???????//?index?of?next?element?to?return
????????int?lastRet?=?-1;?//?index?of?last?element?returned;?-1?if?no?such
????????int?expectedModCount?=?modCount;
?
????????public?boolean?hasNext()?{
????????????return?cursor?!=?size;
????????}
?
????????@SuppressWarnings("unchecked")
????????public?E?next()?{
????????????checkForComodification();
????????????int?i?=?cursor;
????????????if?(i?>=?size)
????????????????throw?new?NoSuchElementException();
????????????Object[]?elementData?=?ArrayList.this.elementData;
????????????if?(i?>=?elementData.length)
????????????????throw?new?ConcurrentModificationException();
????????????cursor?=?i?+?1;
????????????return?(E)?elementData[lastRet?=?i];
????????}
?
????????public?void?remove()?{
????????????if?(lastRet?0)
????????????????throw?new?IllegalStateException();
????????????checkForComodification();
?
????????????try?{
????????????????ArrayList.this.remove(lastRet);
????????????????cursor?=?lastRet;
????????????????lastRet?=?-1;
????????????????expectedModCount?=?modCount;
????????????}?catch?(IndexOutOfBoundsException?ex)?{
????????????????throw?new?ConcurrentModificationException();
????????????}
????????}
?
????????final?void?checkForComodification()?{
????????????if?(modCount?!=?expectedModCount)
????????????????throw?new?ConcurrentModificationException();
????????}
????}
modCount != expectedModCount是否相等,如果不相等則拋出ConcurrentModificationException異常。expectedModCount = modCount賦值,保證兩個值相等,那么問題基本上已經清晰了,在 foreach 循環(huán)中執(zhí)行?list.remove(item);,對 list 對象的 modCount 值進行了修改,而 list 對象的迭代器的 expectedModCount 值未進行修改,因此拋出了ConcurrentModificationException異常。正確!Iterator
?it=list.iterator();
?while(it.hasNext()){
??if(it.next()==3){
???it.remove();
??}
????????}
System.out.println(list);
Iterator.remove()?方法會在刪除當前迭代對象的同時,會保留原來元素的索引。所以用迭代刪除元素是最保險的方法,建議大家使用List過程錯誤!?。?/strong>Iterator
?it=list.iterator();
?while(it.hasNext()){
??Integer?value=it.next();
???if(value==3){
???list.remove(value);
??}
?}
System.out.println(list);
java.util.ConcurrentModificationException,原理同上述方法4.list.remove(2);
System.out.println(list);
remove(object)方法,需要傳入Integer類型,代碼如下:list.remove(new?Integer(2));
System.out.println(list);
推薦閱讀:
Docker鏡像優(yōu)化:從1.16GB到22.4MB,真強!
最近面試BAT,整理一份面試資料《Java面試BATJ通關手冊》,覆蓋了Java核心技術、JVM、Java并發(fā)、SSM、微服務、數據庫、數據結構等等。
朕已閱?

