Queue implementation, Java

Language: Layout:

//'main' method must be in a class 'Rextester'.
//Compiler version 1.8.0_111

import java.util.*;
import java.lang.*;
class Queue{
     int front=-1;
     int rear=-1;
    public void enqueue(int[] arr,int data){
        if(rear==arr.length-1){
            System.out.println("Queue is full");
        }
        else{
            if(rear==-1){
                ++rear;
                ++front;
                arr[rear] = data;
            }
            else{
                ++rear;
                arr[rear] = data;
            }
        }
    }
        public int dequeue(int[] arr){
            int x=0;
            if(front>rear){
                System.out.println("Queue is empty");
                return -1;
            }
            else{
                x = arr[front];
                front++;
            }
            return x;
        }
    }

class Rextester
{  
    public static void main(String args[])
    {
        Queue q = new Queue();
        int arr[] = new int[6];
        q.enqueue(arr,1);
        q.enqueue(arr,3);
        q.enqueue(arr,4);
        q.enqueue(arr,5);
        q.enqueue(arr,7);
        q.enqueue(arr,0);
        q.enqueue(arr,2);
        for(int i=0;i<arr.length;i++){
            System.out.print(arr[i] + " ");
        }
        System.out.println(q.dequeue(arr));
    }
}

[ + ] Show input
Compilation time: 0.83 sec, absolute running time: 0.15 sec, cpu time: 0.13 sec, memory peak: 18 Mb, absolute service time: 0,99 sec