테즈먼해 스터디

LIFO
ex) 웹브라우저 뒤로가기, ctrl + z, ....

FIFO
ex) 인쇄 대기 목록, 쓰기지연저장소

class Study {
    public static void main(String[] args) {
        Stack stack = new Stack();
        stack.push(1);
        stack.push(2);
        stack.push(3);
        System.out.println("stack = " + stack);

        Queue queue = new LinkedList();
        queue.add(1);
        queue.add(2);
        queue.add(3);
        System.out.println("queue = " + queue);

        System.out.println("stack.pop() = " + stack.pop());
        System.out.println("stack = " + stack);

        System.out.println("queue.poll() = " + queue.poll());
        System.out.println("queue = " + queue);


        ArrayDeque arrayDeque = new ArrayDeque<>();
        arrayDeque.add(2);
        arrayDeque.addFirst(1);
        arrayDeque.addLast(3);

        System.out.println("arrayDeque = " + arrayDeque);
        System.out.println("arrayDeque.pop() = " + arrayDeque.pop());
        System.out.println("arrayDeque.poll() = " + arrayDeque.pollLast());
        System.out.println("arrayDeque = " + arrayDeque);
    }
}

stack = [1, 2, 3]
queue = [1, 2, 3]
stack.pop() = 3
stack = [1, 2]
queue.poll() = 1
queue = [2, 3]
arrayDeque = [1, 2, 3]
arrayDeque.pop() = 1
arrayDeque.poll() = 3
arrayDeque = [2]