Java 1.8使用数组实现循环队列

本文实例为大家分享了Java 1.8使用数组实现循环队列的具体代码，供大家参考，具体内容如下

1、引入

使用数组实现循环队列，功能如下：

1）isFull()：队列满？
2）isEmpty()：队列空？
3）add()：添加元素。
4）pop()：移除元素。
5）display()：展示队列。
6）getSize()：获取当前队列元素个数。

2、代码

package DataStructure;

import java.util.Arrays;



public class MyArrayQueue {

 
 private final int DEFAULT_MAX_SIZE = 10;

 
 private int maxSize;

 
 private int front;

 
 private int rear;

 
 private AnyType[] arrQueue;

 
 public MyArrayQueue() {
  this(DEFAULT_MAX_SIZE);
 }//Of the first constructor

 
 public MyArrayQueue(int paraMaxSize) {
  maxSize = paraMaxSize + 1;
  arrQueue = (AnyType[]) new Object[maxSize];
  front = 0;
  rear = 0;
 }//Of the second constructor

 
 public boolean isFull() {
  return (rear + 1) % maxSize == front;
 }//Of isFull

 
 public boolean isEmpty() {
  return front == rear;
 }//Of isEmpty

 
 public void add(AnyType paraVal) {
  if(isFull()) {
   System.out.println("The queue is full.");
   return;
  }//Of if
  arrQueue[rear] = paraVal;
  rear = (rear + 1) % maxSize;
 }//Of add

 
 public AnyType pop() {
  if (isEmpty()) {
   throw new RuntimeException("The queue is full.");
  }//Of if
  AnyType retVal = arrQueue[front];
  front = (front + 1) % maxSize;
  return retVal;
 }//of pop

 
 public void display() {
  if (isEmpty()) {
   System.out.println("The queue is empty.");
   return;
  }//Of if

  System.out.print("The queue is: [");
  int i = front;
  while (i != (rear + maxSize- 1) % maxSize) {
   System.out.printf("%s, ", arrQueue[i]);
   i = (i + 1) % maxSize;
  }//Of while
  System.out.printf("%s]", arrQueue[rear - 1]);
 }//Of display

 
 public int getSize() {
  return (rear - front + maxSize) % maxSize + 1;
 }//Of getSize

 
 public static void main(String[] args) {
  MyArrayQueue  testArrayQueue = new MyArrayQueue<>(3);
  testArrayQueue.add(1);
  testArrayQueue.add(2);
  testArrayQueue.add(4);
  testArrayQueue.pop();
  testArrayQueue.display();
 }//Of main

}//Of MyArrayQueue

以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持考高分网。