문제 풀이 라이브러리, 클래스 추가

정렬

Arrays.sort(array)

 

스택

Stack<Integer> stack = new Stack<Integer>();

stack.pop();

stack.push();

stack.poll();

stack.empty();

stack.peek();

 

큐

Queue<Integer> queue = new LinkedList<>()

queue.add();

queue.peek(); 

queue.poll(); //비어있다면 널

queue.remove();

queue.clear();

 

힙(우선순위 큐)

PriorityQueue<Integer> queue =  new PriorityQueue<Integer>();

Deque

Deque<Integer> LinkedDeque  = new LinkedList<Integer>();

LinkedDeque.add(1); // Add at the last

LinkedDeque.addFirst(2);

LinkedDeque.addLast(3);

LinkedDeque.push(4);

  
Deque<Integer> ArrayDeque = new ArrayDeque<Integer>();

ArrayDeque.add(1); // Add at the last

ArrayDeque.addFirst(2);

ArrayDeque.addLast(3);

ArrayDeque.pop();

ArrayDeque.poll();

ArrayDeque.pollFirst();

ArrayDeque.pollLast();