快捷導(dǎo)航

Java循環(huán)隊列與非循環(huán)隊列的區(qū)別總結(jié)

更新時間：2021年06月22日 09:48:31 作者：小白Melody

今天給大家?guī)淼氖顷P(guān)于Java的相關(guān)知識總結(jié),文章圍繞著Java循環(huán)隊列與非循環(huán)隊列的區(qū)別展開,文中有非常詳細(xì)的介紹及代碼示例,需要的朋友可以參考下

非循環(huán)循環(huán)隊列

判滿：(rear+1) % maxsize == front
判空：front == rear
隊列元素個數(shù)：rear = (rear + maxsize - front) % maxsize
front指針移動方式：front = (front + 1) % maxsize
rear指針移動方式：rear= (rear+ 1) % maxsize

import java.awt.Font;
import java.util.Scanner;
import javax.management.RuntimeErrorException;

public class CircleArrayQueueDemo {

	public static void main(String[] args) {
		//創(chuàng)建隊列
		CircleArrayQueue circleArrayQueue = new CircleArrayQueue(4);
		char key = ' ';
		Scanner scanner = new Scanner(System.in);
		boolean loop = true;
		while(loop) {
			System.out.println("s(show):顯示隊列");
			System.out.println("e(exit):退出程序");
			System.out.println("a(add):添加數(shù)據(jù)到隊列");
			System.out.println("g(get):從隊列取出數(shù)據(jù)");
			System.out.println("h(head):查看隊列頭的數(shù)據(jù)");
			key = scanner.next().charAt(0);
			switch (key) {
			case 's':
				circleArrayQueue.showQueue();
				break;
			case 'e':
				circleArrayQueue.showQueue();
				break;
			case 'a':
				System.out.println("輸入一個數(shù)");
				int value = scanner.nextInt();
				circleArrayQueue.addQueue(value);
				break;
			case 'g':
				try {
					int res = circleArrayQueue.getQueue();
					System.out.printf("取出的數(shù)據(jù)是%d\n",res);
				}catch (Exception e) {
					System.out.println(e.getMessage());
				}
				break;
			case 'h':
				try {
					int res = circleArrayQueue.headQueue();
					System.out.printf("隊列頭的數(shù)據(jù)是%d\n",res);
				}catch (Exception e) {
					System.out.println(e.getMessage());

				}
				break;
			

			default:
				scanner.close();
				loop = false;
				break;
			}
		}
		System.out.println("程序退出");

	}

} 
//隊列
class CircleArrayQueue{
	private int maxsize;
	private int front;
	private int rear;
	private int[] arr;
	//構(gòu)造器
	public CircleArrayQueue(int arrmaxsize) {
		maxsize = arrmaxsize;
		front = 0;
		rear = 0;
		arr = new int[maxsize];
	}
	//判滿
	public boolean isFull() {
		return (rear+1)%maxsize == front;
	}
	//判空
	public boolean isEmpty() {
		return rear == front;
	}
	//入隊
	public void addQueue(int n) {
		if(isFull()) {
			System.out.println("隊列已滿，不能再添加！");
			return;
		}
		//添加數(shù)據(jù)
		arr[rear] = n;
		//rear后移
		rear = (rear + 1) % maxsize;
	}
	//出隊
	public int getQueue() {
		if(isEmpty()) {
			throw new RuntimeException("隊列為空，不可取出元素！");
		}
		//取值
		int value = arr[front];
		//front后移
		front = (front + 1)%maxsize;
		return value;
	}
	//遍歷
	public void showQueue() {
		if(isEmpty()) {
			System.out.println("隊列為空!");
			return;
		}
		for(int i = front; i < front +  size(); i++) {
			System.out.printf("arr[%d]=%d\n",i % maxsize, arr[i % maxsize]);
		}
	}
	//求隊列有效數(shù)據(jù)的個數(shù)
	public int size() {
		return (rear + maxsize - front) % maxsize;
	}
	//顯示隊頭元素
	public int headQueue() {
		if(isEmpty()) {
			throw new RuntimeException("隊列為空，不可取出元素！");
		}
		return arr[front];
	}

結(jié)果示意圖

在這里插入圖片描述

循環(huán)隊列

判滿：(rear+1) % maxsize == front
判空：front == rear
隊列元素個數(shù)：rear = (rear + maxsize - front) % maxsize
front 指針移動方式：front = (front + 1) % maxsizer
ear指針移動方式：rear= (rear+ 1) % maxsize

import java.awt.Font;
import java.util.Scanner;
import javax.management.RuntimeErrorException;

public class CircleArrayQueueDemo {

	public static void main(String[] args) {
		//創(chuàng)建隊列
		CircleArrayQueue circleArrayQueue = new CircleArrayQueue(4);
		char key = ' ';
		Scanner scanner = new Scanner(System.in);
		boolean loop = true;
		while(loop) {
			System.out.println("s(show):顯示隊列");
			System.out.println("e(exit):退出程序");
			System.out.println("a(add):添加數(shù)據(jù)到隊列");
			System.out.println("g(get):從隊列取出數(shù)據(jù)");
			System.out.println("h(head):查看隊列頭的數(shù)據(jù)");
			key = scanner.next().charAt(0);
			switch (key) {
			case 's':
				circleArrayQueue.showQueue();
				break;
			case 'e':
				circleArrayQueue.showQueue();
				break;
			case 'a':
				System.out.println("輸入一個數(shù)");
				int value = scanner.nextInt();
				circleArrayQueue.addQueue(value);
				break;
			case 'g':
				try {
					int res = circleArrayQueue.getQueue();
					System.out.printf("取出的數(shù)據(jù)是%d\n",res);
				}catch (Exception e) {
					System.out.println(e.getMessage());
				}
				break;
			case 'h':
				try {
					int res = circleArrayQueue.headQueue();
					System.out.printf("隊列頭的數(shù)據(jù)是%d\n",res);
				}catch (Exception e) {
					System.out.println(e.getMessage());

				}
				break;
			

			default:
				scanner.close();
				loop = false;
				break;
			}
		}
		System.out.println("程序退出");

	}

} 
//隊列
class CircleArrayQueue{
	private int maxsize;
	private int front;
	private int rear;
	private int[] arr;
	//構(gòu)造器
	public CircleArrayQueue(int arrmaxsize) {
		maxsize = arrmaxsize;
		front = 0;
		rear = 0;
		arr = new int[maxsize];
	}
	//判滿
	public boolean isFull() {
		return (rear+1)%maxsize == front;
	}
	//判空
	public boolean isEmpty() {
		return rear == front;
	}
	//入隊
	public void addQueue(int n) {
		if(isFull()) {
			System.out.println("隊列已滿，不能再添加！");
			return;
		}
		//添加數(shù)據(jù)
		arr[rear] = n;
		//rear后移
		rear = (rear + 1) % maxsize;
	}
	//出隊
	public int getQueue() {
		if(isEmpty()) {
			throw new RuntimeException("隊列為空，不可取出元素！");
		}
		//取值
		int value = arr[front];
		//front后移
		front = (front + 1)%maxsize;
		return value;
	}
	//遍歷
	public void showQueue() {
		if(isEmpty()) {
			System.out.println("隊列為空!");
			return;
		}
		for(int i = front; i < front +  size(); i++) {
			System.out.printf("arr[%d]=%d\n",i % maxsize, arr[i % maxsize]);
		}
	}
	//求隊列有效數(shù)據(jù)的個數(shù)
	public int size() {
		return (rear + maxsize - front) % maxsize;
	}
	//顯示隊頭元素
	public int headQueue() {
		if(isEmpty()) {
			throw new RuntimeException("隊列為空，不可取出元素！");
		}
		return arr[front];
	}
}

結(jié)果示意圖

在這里插入圖片描述

到此這篇關(guān)于Java循環(huán)隊列與非循環(huán)隊列的區(qū)別總結(jié)的文章就介紹到這了,更多相關(guān)Java循環(huán)隊列與非循環(huán)隊列內(nèi)容請搜索腳本之家以前的文章或繼續(xù)瀏覽下面的相關(guān)文章希望大家以后多多支持腳本之家！

您可能感興趣的文章: