List<타입> 객체명 = new ArrayList<타입>(초기 저장용량);ArrayList<타입> 객체명 = new ArrayList<타입>(초기 저장용량);List<String> list = new ArrayList<>();
list = new LinkedList() <<== list 에 LinkedList 못담게됨(재활용 못함)List<String> fruit = new ArrayList<>();fruit.add("apple");fruit.add(1, "orange"); -> 1번방에 "orange"추가되고 그 뒤에 있던 것들은 한칸씩 뒤로 감. System.out.println(fruit.get(i));Iterator it = fruit.iterator(); // [apple, orange, banana, Melon]
while(it.hasNext()) {
System.out.println(it.next());
}fruit.remove(1);System.out.println(fruit.size());List<String> newFruit = new ArrayList<>();
newFruit.addAll(fruit);List<String> newFruit2 = new ArrayList<>();
newFruit2.add("orange");
newFruit2.addAll(1, fruit);newFruit2.set(1, "사과");newFruit2.clear();List<String> newFruit2 = (ArrayList<String>) ((ArrayList<String>) fruit).clone();System.out.println(fruit.contains("banana")); // trueSystem.out.println(fruit.contains("없으면")); // falseCollections.sort(fruit);Collections.sort(fruit, String.CASE_INSENSITIVE_ORDER);Collections.sort(fruit, Collections.reverseOrder());Collections.sort(fruit, Collections.reverseOrder(String.CASE_INSENSITIVE_ORDER));fruit.sort(Comparator.naturalOrder());fruit.sort(String.CASE_INSENSITIVE_ORDER);fruit.sort(Comparator.reverseOrder());fruit.sort(Collections.reverseOrder().reversed());