数组模拟队列
class ArrayQueue{
private int maxSize;
private int front;
private int rear;
private int[] arr;
public ArrayQueue() {
}
public ArrayQueue(int maxSize) {
this.maxSize = maxSize;
arr = new int[maxSize];
front=-1;
rear=-1;
}
public boolean isFull(){
return rear==maxSize-1;
}
public boolean isNull(){
return rear==front;
}
public void addQueue(int n){
if (isFull()) {
System.out.println("队列满了");
return;
}
rear++;
arr[rear]=n;
}
public int getQueue(){
if (isNull()){
throw new RuntimeException("队列空,不能取数据");
}
front++;
return arr[front];
}
public void showQueue(){
if (isNull()){
System.out.println("队列空的");
}
for (int i = 0; i < arr.length; i++) {
System.out.printf("arr[%d]=%d\n",i,arr[i]);
}
}
public int headQueue(){
if (isNull()){
throw new RuntimeException("队列空的");
}
return arr[front+1];
}
}
进行测试
public static void main(String[] args) {
ArrayQueue arrayQueue = new ArrayQueue(3);
char key = ' ';
Scanner sc = new Scanner(System.in);
boolean loop = true;
while (loop){
System.out.println("s(show):显示队列");
System.out.println("e(exit):退出程序");
System.out.println("a(add):添加数据");
System.out.println("g(get):拿出数据");
System.out.println("h(head):查看队列头数据");
key = sc.next().charAt(0);
switch (key){
case 's':
arrayQueue.showQueue();
break;
case 'e':
sc.close();
loop=false;
break;
case 'a':
System.out.println("请输入一个数字");
int value = sc.nextInt();
arrayQueue.addQueue(value);
break;
case 'g':
try {
int res = arrayQueue.getQueue();
System.out.println("取出的数据为"+res);
}catch (Exception e){
System.out.println(e.getMessage());
}
break;
case 'h':
try {
int res = arrayQueue.headQueue();
System.out.println("队列头的数据是"+res);
} catch (Exception e) {
e.printStackTrace();
}
break;
}
}
System.out.println("程序退出");
}
升级,环形队列
class ArrayQueue2{
private int maxSize;
private int front;
private int rear;
private int[] arr;
public ArrayQueue2() {
}
public ArrayQueue2(int maxSize) {
this.maxSize = maxSize;
arr = new int[maxSize];
}
public boolean isFull(){
return (rear+1)%maxSize==front;
}
public boolean isNull(){
return rear==front;
}
public void addQueue(int n){
if (isFull()) {
System.out.println("队列满了");
return;
}
arr[rear] = n;
rear = (rear+1)%maxSize;
}
public int getQueue(){
if (isNull()){
throw new RuntimeException("队列空,不能取数据");
}
int value = arr[front];
front = (front+1) % maxSize;
return value;
}
public void showQueue(){
if (isNull()){
System.out.println("队列空的");
}
for (int i = front; i <front + size(); i++) {
System.out.printf("arr[%d]=%d\n",i % maxSize,arr[i%maxSize]);
}
}
public int headQueue(){
if (isNull()){
throw new RuntimeException("队列空的");
}
return arr[front];
}
public int size(){
return (rear+maxSize-front)%maxSize;
}
}
比之前多了取模操作,每一个循环,指针都会回来重新指向开始位置,形成一个循环.
public static void main(String[] args) {
System.out.println("测试数组环形队列");
ArrayQueue2 arrayQueue = new ArrayQueue2(4);
char key = ' ';
Scanner sc = new Scanner(System.in);
boolean loop = true;
while (loop){
System.out.println("s(show):显示队列");
System.out.println("e(exit):退出程序");
System.out.println("a(add):添加数据");
System.out.println("g(get):拿出数据");
System.out.println("h(head):查看队列头数据");
key = sc.next().charAt(0);
switch (key){
case 's':
arrayQueue.showQueue();
break;
case 'e':
sc.close();
loop=false;
break;
case 'a':
System.out.println("请输入一个数字");
int value = sc.nextInt();
arrayQueue.addQueue(value);
break;
case 'g':
try {
int res = arrayQueue.getQueue();
System.out.println("取出的数据为"+res);
}catch (Exception e){
System.out.println(e.getMessage());
}
break;
case 'h':
try {
int res = arrayQueue.headQueue();
System.out.println("队列头的数据是"+res);
} catch (Exception e) {
e.printStackTrace();
}
break;
}
}
System.out.println("程序退出");
}