Méthodes ArrayList
Introduit| English | Sens |
|---|---|
| ArrayList/əˈreɪ lɪst/ | ArrayList |
Insertion changes the later indices
- An ArrayList starts
[cat, dog].add(1, "owl")makes[cat, owl, dog], thenremove(0)makes[owl, dog].get(1)now returns"dog". - Trace the whole list after each operation: insertion shifts later elements right, while removal shifts them left. An index identifies a position, not a permanent identity for an element.
![An insertion and a removal change later indices: start [cat, dog]; add(1, "owl") gives [cat, owl, dog], shifting dog from index 1 to 2; remove(0) gives [owl, dog], shifting both left](/learn-media/ap_computer_science_a/assets/0408-index-shifts.png?v=1794647927)
A list has a size and an element type
- An ArrayList 动态数组 stores a resizable sequence of references. Import
java.util.ArrayListand declareArrayList<String> names = new ArrayList<String>();; size initially equals 0. - The type parameter is a reference type, so use
Integerfor whole numbers rather thanint.size()counts stored elements; an initial capacity is space available for growth and does not create that many elements.
Append or insert within the right bounds
add(x)appends an element;add(i, x)inserts before the current element at i. For insertion, valid indices run from 0 through size inclusive, soadd(size(), x)appends too.get(i)reads an existing element, so its indices run from 0 through size minus 1. An empty list has no valid get index;get(size())is out of bounds even though insertion there is allowed.
Pour une liste de taille 2, add(2, value) est autorisé mais get(2) est hors limites.
Difficulté 1/5 · 100 pièces + un petit bonus lors de la première réussite aujourd'hui
L'insertion permet la position égale à la taille ; get nécessite un indice existant strictement inférieur à la taille.
Replacement and removal return different results
set(i, x)replaces an existing element and returns the old value without changing size.remove(int i)removes the element at that position, returns it, and decreases size by one.- The overloaded
remove(Object value)instead removes the first equal value and returns whether a match was removed. In anArrayList<Integer>,remove(1)means index 1; useremove(Integer.valueOf(1))to remove the value 1.
import java.util.ArrayList;
import java.util.Arrays;
public class RemoveChoice {
public static void main(String[] args) {
ArrayList<Integer> byIndex = new ArrayList<>(Arrays.asList(1, 2, 1));
ArrayList<Integer> byValue = new ArrayList<>(Arrays.asList(1, 2, 1));
int removed = byIndex.remove(1);
boolean found = byValue.remove(Integer.valueOf(1));
System.out.println(removed + " " + byIndex);
System.out.println(found + " " + byValue);
}
}
The two outputs are 2 [1, 1] and true [2, 1]. Each list loses one element, but a different one.
![Same argument value, different declared type: on the list [1, 2, 1], remove(1) uses an int index and removes index 1, giving [1, 1] and returning 2; remove(Integer.valueOf(1)) removes the first value equal to 1, giving [2, 1] and returning true](/learn-media/ap_computer_science_a/assets/0408-remove-overload.png?v=1794647927)
add, get, et remove
Après remove(0), dog passe à l'index 0 et la taille diminue à 1.
Comment obtenir le nombre d'éléments dans un ArrayList list ?
Difficulté 1/5 · 100 pièces + un petit bonus lors de la première réussite aujourd'hui
ArrayList utilise size() ; les tableaux utilisent .length.
Pour un ArrayList list comportant au moins trois éléments, comment accéder à l'élément à l'indice 2 ?
Difficulté 1/5 · 100 pièces + un petit bonus lors de la première réussite aujourd'hui
ArrayList utilise get(i), pas [i].
Après a.remove(0) sur {cat, dog}, que vaut a.get(0) ?
Difficulté 1/5 · 100 pièces + un petit bonus lors de la première réussite aujourd'hui
remove(0) supprime cat ; dog passe à l'index 0.
On peut accéder à un élément d'un ArrayList avec des crochets, comme list[0].
Difficulté 1/5 · 100 pièces + un petit bonus lors de la première réussite aujourd'hui
ArrayList utilise des méthodes (get/set), pas la syntaxe [].
add(x) avec un argument ajoute x...
Difficulté 1/5 · 100 pièces + un petit bonus lors de la première réussite aujourd'hui
add(x) ajoute à la fin ; add(i, x) insère à l'index i.
En partant de [1, 2, 1], remove(1) est appelé avec un argument int. Quelle valeur est renvoyée ?
Difficulté 2/5 · 140 pièces + un petit bonus lors de la première réussite aujourd'hui
La surcharge int supprime l'indice 1, dont l'élément est 2.
Choose by the declared argument type
- Java selects the overload using the argument type.
int index = 1; list.remove(index);removes position 1;Integer value = 1; list.remove(value);selects value removal. - A String list can remove
"owl"by value or index 0 by position. Decide which you mean before tracing shifts; finding no equal value returns false and leaves the list unchanged.
Arrays use a[i] and a.length; ArrayList uses get(i) and size(). Keep insertion bounds separate from existing-element bounds, and do not assume that an integer-looking argument to remove always means a stored value.
Check one replacement and one failed removal
- Starting from
[owl, dog],set(1, "fox")returns"dog"and leaves[owl, fox]with size 2.remove("cat")then returns false and changes nothing. - Check empty lists, the first/last valid positions, and a value that is absent. Read the overload and its return value as well as the resulting list; replacing, inserting and deleting have different contracts.
ArrayList is a resizable sequence accessed through methods. Insert at 0 through size; read, replace or remove an existing position at 0 through size minus 1. remove(int) deletes a position; remove(Object) deletes the first equal value if found.
After the stated insertion and removal, type the value returned by get(0).
Difficulté 1/5 · 100 pièces + un petit bonus lors de la première réussite aujourd'hui
The final list is [owl, dog], with owl at index 0.