Stack/Queue

Stack

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

s.push();
s.peek();
s.pop();
s.empty(); //returns bool
s.size();
s.celar();
s.contains(1) 

Queue

// 선언
Queue<Integer> queue = new LinkedList<>(); 
Queue<String> queue = new LinkedList<>(); 

Queue<Integer> stack = new LinkedList<>(); 
queue.add(1);  
queue.add(2); 
queue.offer(3);  

Queue<Integer> queue = new LinkedList<>(); 
queue.offer(1);    
queue.offer(2);    
queue.offer(3);   
queue.poll();    
queue.remove();    
queue.clear();      

Queue<Integer> queue = new LinkedList<>(); 
queue.offer(1);   
queue.offer(2);  
queue.offer(3);    
queue.peek();      

[백준] 18258번 : 큐 2 - JAVA [자바]TISTORY

Deque

우선순위 큐