Implementation of a simple Array based queue
public class SimpleArrayQueue { public static void main(String[] args) { MyQueue queue = new MyQueue(10); queue.enqueue(10); queue.enqueue(20); queue.dequeue(); queue.enqueue(20); System.out.println(queue); } } class MyQueue{ Object[] queue = null; int size = 0; int front = 0; int rear = 0; public MyQueue(int size) { queue = new Object[10]; } public void enqueue(Object item){ if(size == queue.length){ System.out.println("Overflow!!!"); return; } size++; queue[rear] = item; rear = (rear + 1) % queue.length; } public Object dequeue(){ if(size == 0){ System.out.println("Underflow!!!"); return null; } Object item = queue[front]; queue[front] = null; front = (front + 1) % queue.length; size--; return item; } public String toString(){ StringBuilder sb = new StringBuilder(); for(int i=front; i<rear; i++){ sb.append(" "+queue[i]); } return sb.toString(); } }
There was an error while loading. Please reload this page.