| English | 释义 | 拼音 |
|---|---|---|
| ConcurrentModificationException/kənˈkʌrənt ˌmɒdɪfɪˈkeɪʃn ekˈsepʃn/ | 并发修改异常 | bìng fā xiū gǎi yì cháng |
Choose a traversal that matches the intended change
- An ArrayList contains [2, 3, 4]. You want to double every stored value, while keeping the number of elements unchanged.
- An indexed loop can use list.set(i, 2 * list.get(i)). Assigning x = 2*x in for (int x : list) changes only the local loop variable.
![Choose a traversal that matches the change: to double every value in [2, 3, 4], an indexed loop with list.set(i, 2 * list.get(i)) gives [4, 6, 8]; assigning x = 2 * x in an enhanced for loop changes only the local variable and leaves [2, 3, 4]](/learn-media/ap_computer_science_a/assets/0409-double-values.png?v=1794647927)
从列表[2, 3, 4]开始,执行for (int x : list) { x = 2 * x; }。list.get(1)的值是什么?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
赋值局部原始类型变量x并不会替换已存储的Integer对象。中间列表元素仍保持为3。
Looping over a list
- Traverse an ArrayList just like an array, but with its methods. Indexed:
for (int i = 0; i < list.size(); i++) { ... list.get(i) ... } - For-each:
for (String s : list) { ... s ... }— clean for reading values.size()(notlength) bounds the indexed loop.
The same patterns
- Sum, count, min/max, and search all work the same as with arrays. Just swap
a[i]forlist.get(i)anda.lengthforlist.size(). - The accumulator and max/count logic is identical. Everything you learned for array traversal carries over.
Reading vs. modifying
- An enhanced loop copies each element value into its loop variable. For
Integerelements read asint x, assigning toxdoes not replace a list element; an indexed loop can replace it withset(i, x). - For structural changes (adding/removing), use the indexed loop carefully. Reading is simple; removing while looping needs extra care (next lesson).
按下标对 ArrayList 求和
用 size() 设界,用 get(i) 读取(list = [10,20,30])。
带下标 ArrayList 循环的正确条件是……
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
ArrayList 用 size();数组用 length。
Why should a program avoid direct structural changes during an ArrayList enhanced-for traversal?
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
ArrayList fail-fast behaviour is best-effort. Avoid unsafe traversal rather than relying on a guaranteed exception.
数组的遍历模式(求和、计数、最大)对 ArrayList 同样工作。
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
只需把 a[i]/a.length 换成 list.get(i)/list.size()。
要在遍历列表时安全地删除元素,你应该用……
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
for-each 不能结构性修改;带下标循环可以(要小心)。
若在遍历过程中不修改结构,增强for循环可以读取ArrayList
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
该循环读取每个存储的引用。遍历期间的结构变更属于独立问题;此声明并不保证对每个可能元素的所有操作都是安全的。
Don't modify during for-each
- Adding or removing during a for-each loop may trigger a ConcurrentModificationException 并发修改异常; fail-fast detection is best-effort. The for-each loop assumes the list doesn't change structure underneath it.
- To remove while traversing, use an indexed loop (and manage the index). Reading with for-each is suitable when the list is not structurally changed during traversal. Also check element requirements: unboxing a null Integer still throws an exception.
Bound an indexed ArrayList loop with list.size(), not .length, and never structurally modify during a for-each. Calling add/remove inside a for (x : list) may trigger a ConcurrentModificationException, but detection is not guaranteed. To delete while traversing, use an indexed loop — and remember remove(i) shifts later elements, so don't blindly i++ past the shifted element.
After the indexed doubling update, what is list.get(1)?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
The middle stored value 3 is replaced by 6. Reassigning a primitive loop variable would leave it at 3.
对于非空的Student条目,在for (Student s : students)循环内调用s.addScore(5)可以在不添加或删除列表元素的情况下修改已存储的学生对象。
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
复制后的引用指向可变的Student对象。它们的字段可以改变,而无需改变列表结构。
Summing an ArrayList
- Indexed:
for (int i = 0; i < list.size(); i++) { sum += list.get(i); } - For-each:
for (int x : list) { sum += x; }(autoboxing/unboxing handles Integer↔int). - Both total the list; for-each is cleaner for read-only.
Carry the reasoning to a new case
- Adding or removing directly during enhanced traversal is unsafe; fail-fast exceptions are best-effort, not a guaranteed correctness check.
- A list of mutable Student objects can be traversed with
for (Student s : students) { s.addScore(5); }, assuming non-null entries. This changes each object's state without changing list structure; assigning a different reference toswould not replace the stored element.
Traverse an ArrayList with an indexed loop (i < list.size(), list.get(i)) or an enhanced loop that receives each element value. The array patterns (sum, count, min/max, search) all carry over. Avoid direct structural changes during an enhanced traversal: a ConcurrentModificationException may detect the bug, but is not guaranteed. Use a carefully managed indexed loop for the removal pattern taught next; changing a referenced object's fields is different from changing list structure.