pulkit_queue

package circularqueue;

import javax.swing.border.EmptyBorder;

public class MyQueue {
    private int[] queue;
    private int front;
    private int rear;
    private int size;
    public MyQueue(int sizeOfArray){
        queue=new int[sizeOfArray];
        front=-1;
        rear=-1;
        size=0;
    }
    public boolean isEmpty(){
        boolean response = false;
        if(size==0){
            response=true;
        }
        return response;
    }
    public boolean enqueue(int element){
        boolean response = true;
        if(rear!=queue.length-1){
            rear++;
            queue[rear]=element;
            size++;
            response=true;
            if(rear == queue.length-1 && size!=queue.length){
                rear = -1;
            }
        }
        return response;
    }
    public int dequeue(){
        int response=0;
        if(!isEmpty()){
            front++;
            response=queue[front];
            size--;
            if(front==queue.length-1 && size!=queue.length){
                front=-1;
            }
        }
        return response;
    }
    public int peek(){
        int response = 0;
        if(!isEmpty()){
            response=queue[front+1];
        }
        return response;
    }
    public int size(){
        return size;
    }
}






package queue;

public class MyQueue {
    private int[] queue;
    private int front;
    private int rear;
    //number of elements
    private int size;
    public MyQueue(int sizeOfArray){
        queue=new int[sizeOfArray];
        front=-1;
        rear=-1;
        size=0;
    }

    //isEmpty
    public boolean isEmpty(){
        boolean response=false;
        if(front==rear){
            response=true;
        }
        return response;
    }
    //enqueue
    public boolean enqueue(int element){
        boolean response = false;
        if(rear!=queue.length-1){
            rear++;
            queue[rear]=element;
            size++;
            response=true;
        }
        return response;
    }
    //dequeue
    public int dequeue(){
        int response=0;
        if(!isEmpty()){
            front++;
            response=queue[front];
            size--;
        }
        return response;
    }
    //peek
    public int peek(){
        int response=0;
        if(!isEmpty()){
            response=queue[front+1];
        }
        return response;
    }
    //size
    public int size(){
        return size;
    }
}

package queue.main;
import queue.MyQueue;
public class MyMain {
    public static void main(String[] args) {
        MyQueue queue=new MyQueue(10);
        System.out.println(queue.dequeue());
        System.out.println(queue.peek());
        System.out.println(queue.isEmpty());
        System.out.println(queue.enqueue(1234));
        System.out.println(queue.peek());
        System.out.println(queue.isEmpty());
        System.out.println(queue.dequeue());
    }

}