ArrayList in AP Computer Science A

Collections.reverse(words);

for(int i=0;i<words.size()/2;i++){String temp=words.get(i);words.set(i,words.get(words.size()-i-1));words.set(words.size()-i-1,temp);}

Collections.sort(words, Comparator.reverseOrder());

words.sort(Collections.reverseOrder());

NoSuchElementException

IllegalArgumentException

IndexOutOfBoundsException

ArithmeticException

An updated list without the element at that position.

True if the element exists, false otherwise.

The number of elements in the list.

The element at the specified index in the list.

red

blue

IndexOutOfBoundsException

green

Store distinct ArrayLists for each shape type separately.

Use instanceOf before casting every object from shapes.

Implement polymorphic methods within each Shape subclass.

Cast all objects from shapes array into their respective classes.

inventory.indexOf("widget") >=0

inventory.contains("widget")

“widget”.existsIn(inventory)

inventory.hasItem("widget")

Replaces the largest value in doublesList with $\pi$ (Math.PI).

Replaces all occurrences of $\pi$ (Math.PI) in doublesList with the maximum value found in it.

Adds $\pi$ (Math.PI) as a new item after every occurrence of max value found within doublesList.

Inserts $\pi$ (Math.PI) into doublesList without affecting any other items.

doubles = Doubles.Stream.generate(Math.random).limit(10).map(D->new BigDecimal(D.toString()).setScale(2, BigDecimal.RoundingMode.HALF_UP).doubleValue()).collect(Collectors.toList());

doubles = doubles.stream().mapToObj(BigDecimal::new).map(bd -> bd.setScale(2, RoundingMode.UP).doubleValue()).collect(Collectors.toList());

Doubles.replaceAll(BD->Double.parseDouble(String.format("%.2f", BD)));

Doubles.forEach(D->{BigDecimal BD=new BigDecimal(Double.toString(D));BD=BD.setScale(2,RoundingMode.HALF_UP);D=BD.doubleValue();});

They allow variables to be shared freely between classes without encapsulation.

They enable Java programs to run on any platform without modification.

They directly increase the processing power of the computer.

They break down complexity into smaller, manageable parts.

Using clear().

Using remove(int index).

Using add(E e).

Using get(int index).