數(shù)據(jù)結(jié)構(gòu)可分為兩種，第一種是線性結(jié)構(gòu)，第二種是非線性結(jié)構(gòu)，線性結(jié)構(gòu)又分為連續(xù)存儲(chǔ)和鏈表存儲(chǔ)。
常見(jiàn)的線性結(jié)構(gòu)有數(shù)組，鏈表，隊(duì)列，棧；
以下是數(shù)組模擬隊(duì)列的實(shí)現(xiàn)（隊(duì)列特點(diǎn)就是先進(jìn)先出）:

//數(shù)組模擬隊(duì)列 public class ArrayQueueDemo {public static void main(String[] args) {ArrayQueue queue = new ArrayQueue(3);char key = ' '; //接收用戶(hù)輸入Scanner scanner = new Scanner(System.in);boolean f = true;while(f){System.out.println("s:顯示隊(duì)列");System.out.println("a:添加數(shù)據(jù)");System.out.println("e:退出程序");System.out.println("h:顯示頭部數(shù)據(jù)");System.out.println("g:取出數(shù)據(jù)");key = scanner.next().charAt(0);switch(key) {case 's':queue.show();break;case 'a':System.out.println("輕輸入一個(gè)數(shù)據(jù)");int value = scanner.nextInt();queue.add(value);break;case 'h':try {int res = queue.head();System.out.println(res);} catch (Exception e) {// TODO: handle exceptionSystem.out.println(e.getMessage());}break;case 'g':try {int res = queue.get();;System.out.println(res);} catch (Exception e) {// TODO: handle exceptionSystem.out.println(e.getMessage());}break;case 'e':scanner.close();f = false;break;default:break;}}System.out.println("退出程序");}}class ArrayQueue{private int maxSize; // 隊(duì)列的最大容量private int front; //指向隊(duì)列的頭部private int rear; //指向隊(duì)列的尾部private int[] arr;//使用數(shù)組創(chuàng)建隊(duì)列//創(chuàng)建隊(duì)列的構(gòu)造器public ArrayQueue(int arrMaxSize) {maxSize = arrMaxSize;arr = new int[maxSize];front = -1; //隊(duì)列頭部 指向的是頭部前面的位置rear = -1;// 隊(duì)列尾部 包含尾部數(shù)據(jù)}//判斷隊(duì)列是否滿了public boolean isFull() {return rear == maxSize - 1;}//判斷隊(duì)列是否為空public boolean isNull() {return front == rear;}//將數(shù)據(jù)添加到隊(duì)列中public void add(int num ) {if(isFull()) {System.out.println("隊(duì)列已經(jīng)滿了，不能添加數(shù)據(jù)");return;}rear ++;arr[rear] = num;}//取出隊(duì)列數(shù)據(jù) 相當(dāng)于刪除數(shù)據(jù)public int get() {if(isNull()) {throw new RuntimeException("隊(duì)列為空，沒(méi)有數(shù)據(jù)");}front++;return arr[front];}//顯示隊(duì)列的全部數(shù)據(jù)public void show() {if(isNull()) {System.out.println("隊(duì)列為空，沒(méi)有數(shù)據(jù)");return;}for(int i = 0; i<arr.length;i++) {System.out.println(arr[i]);}}//顯示隊(duì)列頭部數(shù)據(jù)public int head() {if(isNull()) {throw new RuntimeException("隊(duì)列為空");}return arr[front+1];}}

總結(jié)

以上是生活随笔為你收集整理的数组模拟队列(代码实现)的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。