Algorithm (2) 썸네일형 리스트형 자바 알고리즘 Queue class Queue { private int maxSize; private int[] queueArray; private int front; private int rear; private int currentSize; public Queue(int size) { maxSize = size; queueArray = new int[maxSize]; front = 0; rear = -1; currentSize = 0; } public void enqueue(int item) { if (isFull()) { System.out.println("Queue is full. Cannot enqueue."); return; } rear = (rear + 1) % maxSize; queueArray[rear] = it.. 스택(Stack) package stack; public class Stack { private int maxSize; private int top; private int[] array; public Stack(int capacity) { maxSize = capacity; top = -1; array = new int[maxSize]; } public void push(int item) { if (top == maxSize - 1) { System.out.println("Stack is full. Cannot push item: " + item); } else { array[++top] = item; } } public int pop() { if (top == -1) { System.out.println("Stack i.. 이전 1 다음
