java queue (1) 썸네일형 리스트형 자바 알고리즘 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.. 이전 1 다음
