package DateStructuresHomework;
import java.util.Scanner;
public class Queue {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int maxsize;
maxsize=in.nextInt();
ArrayQueue queue=new ArrayQueue(maxsize);
int n=0;
for (int i = 0; i < maxsize; i++)
{
n=in.nextInt();
queue.addQueue(n);
n=0;
}
queue.showQueue2();
queue.getQueue();
queue.showQueue2();
}
}
class ArrayQueue {
private int maxSize;
private int front;
private int rear;
private int[] arr;
public ArrayQueue(int arrMaxSize) {
maxSize = arrMaxSize;
arr = new int[maxSize];
front = -1;
rear = -1;
}
public boolean isFull() {
return rear == maxSize - 1;
}
public boolean isEmpty() {
return rear == front;
}
public void addQueue(int n) {
if (isFull()) {
System.out.println("队列满,不能加入数据~");
return;
}
rear++;
arr[rear] = n;
}
public int getQueue() {
if (isEmpty()) {
throw new RuntimeException("队列空,不能取数据");
}
front++;
return arr[front];
}
public void showQueue() {
if (isEmpty()) {
System.out.println("队列空的,没有数据~~");
return;
}
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]+" ");
}
}
public void showQueue2() {
if (isEmpty()) {
System.out.println("队列空的,没有数据~~");
return;
}
for (int i = 0; i < arr.length-1; i++) {
System.out.print(arr[i]+" ");
