//init Integer[] intList = {1, 2, 3, 4, 5}; List<Integer> list0 = Arrays.asList(intList); List<Integer> list = new ArrayList<>();
//get ith int i = list.get(3); // get size int len = list.size(); //sort Collections.sort(list); list.sort(Collections.reverseOrder()); list.sort((a, b) -> (a - b)); //remove list.remove(1); //add list.add(4); //empty boolean em = list.isEmpty(); //subList List<Integer> subList = list.subList(0,3);
// init Deque<Integer> deque = new LinkedList<>(); Deque<Integer> deque1 = new ArrayDeque<>(); /* as queue: add from the tail remove from the head */ //offer deque.offerLast(3); deque.offer(3);
//poll deque.poll(); //peek deque.peek(); //empty deque.isEmpty(); /* as stack add from the head remove from the head */ //push deque.offerFirst(3); deque.push(4); //pop deque.pop(); //peek deque.peek(); //empty deque.isEmpty();