ArrayList in AP Computer Science A

myList.size()

myList.capacity()

myList.count()

myList.length()

Puts all elements of an ArrayList into an array in reverse order

Puts all elements of an array into an ArrayList in the original order

Puts all elements of an array into an ArrayList in reverse order

Puts all elements of an ArrayList into an array in the original order

When iterating over each element to apply a uniform operation.

When iterating through the list by index from start to finish.

When indexing elements at even positions only.

When you need to iterate until a certain condition changes, and the number of iterations isn't known beforehand.

put()

insert()

add()

append()

Implement nested loops comparing every pair between lists before adding non-duplicates.

Apply recursive backtracking method ensuring each addition maintains uniqueness.

Use an if-statement inside a for-each loop checking !listB.contains(element) before appending.

Use 'listB.addAll(listA)' ignoring duplicate entries.

Call fruits.replaceAll('apple', 'orange');

Apply Collections.swap(fruits, fruits.indexOf('apple'), fruits.indexOf('orange'));

Use a for-loop to check each string with equals('apple') and set that index's value to 'orange'.

Use fruits.indexOf('apple') repeatedly until all instances are replaced with oranges.

static int addItem(ArrayList list)

public boolean addItem(ArrayList list)

public void addItem(ArrayList list) throws IllegalArgumentException

private void addItem(ArrayList list) throws IOException

records.swap(item, index);

records.update(index, item);

records.set(index, item);

records.replace(item, index);

ArrayLists can change size dynamically as needed.

ArrayLists have a fixed size that cannot change once initialized.

ArrayLists improve the speed of all search operations compared to arrays.

ArrayLists are more memory efficient than arrays with large datasets.

8

6

2

5