快捷導(dǎo)航

java數(shù)組實(shí)現(xiàn)循環(huán)隊(duì)列示例介紹

更新時(shí)間：2022年01月10日 09:54:41 作者：小輝小輝-

大家好，本篇文章主要講的是java數(shù)組實(shí)現(xiàn)循環(huán)隊(duì)列示例介紹，感興趣的同學(xué)趕快來看一看吧，對(duì)你有幫助的話記得收藏一下，方便下次瀏覽

從頂部進(jìn)去數(shù)據(jù)，從底部出來數(shù)據(jù)，用數(shù)組實(shí)現(xiàn)隊(duì)列，但是下面這個(gè)隊(duì)列，只能進(jìn)行一次存數(shù)值，取數(shù)值，不夠完善。

import java.util.Scanner;
 
public class ArrayQueueDemo {
    public static  void main(String[]args){
        //定義隊(duì)列大小maxsize
        ArrayQueue arrayQueue=new ArrayQueue(3);
        Scanner scanner=new Scanner(System.in);
        char key=' ';
        boolean  leap=true;
        while(leap){
            System.out.println("s(show):顯示隊(duì)列");
            System.out.println("e(exit):退出程序");
            System.out.println("h(head):顯示頭條數(shù)據(jù)");
            System.out.println("a(add):添加數(shù)據(jù)");
            System.out.println("g(get):從程序中取出隊(duì)列");
            System.out.println("請(qǐng)輸入一個(gè)數(shù)");
 
            key= scanner.next().charAt(0);
            switch (key){
                case 's':
                    arrayQueue.showQueue();
                    break;
 
                case 'h':
                    System.out.printf("頭數(shù)據(jù)為%d",arrayQueue.showHead());
                    break;
                case 'a':
                    System.out.println("輸入添加數(shù)據(jù)");
                   int data= scanner.nextInt();
                    arrayQueue.addQueue(data);
                    break;
                case 'g':
                   arrayQueue.getQueue();
                    break;
                case 'e':
                    leap=false;
                     break;
                default:
                    break;
 
 
            }
        }
 
    }
 
}
class ArrayQueue{
    private  int maxsize;//隊(duì)列大小
    private int rear;
    private int front;
    private int [] arry;
    public ArrayQueue(int maxsize1){
        maxsize=maxsize1;
        arry=new int[maxsize];
        front =-1;
        rear=-1;
    }
    //判斷隊(duì)列是否滿
    public boolean isFull(){
        return rear==maxsize-1;
    }
    //增加數(shù)據(jù)
    public  void addQueue(int data){
        if (isFull()){
            System.out.println("隊(duì)列滿了");
        }
        else{
            arry[rear+1]=data;
            rear++;
 
 
        }
    }
    //顯示數(shù)據(jù)
    public  void showQueue(){
        for (int i = 0; i < arry.length; i++) {
            System.out.println();
            System.out.printf("%d",arry[i]);
 
        }
    }
    //是否空
    public boolean isEmpety(){
        return rear== front;
    }
    //顯示頭數(shù)據(jù)
    public int showHead() {
        if (isEmpety()) {
 
            throw new RuntimeException("隊(duì)列是空的");
        }
        return arry[front +1];
 
    }
    public int getQueue(){
        if (isEmpety()){
            throw new RuntimeException("隊(duì)列是空");
 
        }
        System.out.printf("去除一個(gè)隊(duì)列為%d",arry[++front]);
        arry[front]=0;
 
        return 0;
 
    }
 
 
 
 
}

循環(huán)隊(duì)列，可以進(jìn)行數(shù)據(jù)插入和取出，是上個(gè)普通隊(duì)列的增強(qiáng)版。上個(gè)隊(duì)列只能使用一次的情況被解決了

import java.util.Scanner;
 
public class CircleArrayQueueDemo {
    public  static void main(String[] args){
        //定義隊(duì)列大小maxsize
        cirCleArray cirCleArray=new cirCleArray(3);//隊(duì)列大小是三，但是有效數(shù)據(jù)是兩個(gè)
        Scanner scanner=new Scanner(System.in);
        char key=' ';
        boolean  leap=true;
        while(leap){
            System.out.println("s(show):顯示隊(duì)列");
            System.out.println("e(exit):退出程序");
            System.out.println("h(head):顯示頭條數(shù)據(jù)");
            System.out.println("a(add):添加數(shù)據(jù)");
            System.out.println("g(get):從程序中取出隊(duì)列");
            System.out.println("請(qǐng)輸入一個(gè)數(shù)");
 
            key= scanner.next().charAt(0);
            switch (key){
                case 's':
                    cirCleArray.showCircleArray();
                    break;
 
                case 'h':
                    System.out.printf("頭數(shù)據(jù)為%d",cirCleArray.showHead());
                    break;
                case 'a':
 
                   cirCleArray.addQueue();
                    break;
                case 'g':
                    cirCleArray.getQueue();
                    break;
                case 'e':
                    leap=false;
                    break;
                default:
                    break;
 
 
            }
 
 
    }
 
    }
}
    class cirCleArray{
        private int maxsize;
        private int front;
        private int rear;
        private int [] arry;
        Scanner scanner=new Scanner(System.in);
        public cirCleArray(int maxsize1){
            this.maxsize=maxsize1;
          arry=new int[maxsize];
            front=0;
            rear=0;
        }
        //顯示隊(duì)列
        public void showCircleArray(){
            if (isEmpty()){
                System.out.println("隊(duì)列為空");
            }
            else{
                for (int i =front; i < front+size(); i++) {
                    System.out.printf("arry[%d]=%d\n",i % maxsize,arry[i % maxsize]);
                }
            }
 
        }
        public  int size(){
            return (rear+maxsize-front)%maxsize;
        }
        //隊(duì)列為空
        public boolean isEmpty(){
            return front==rear;
        }
        //隊(duì)列為滿
        public boolean isFull(){
            return (rear+1)%maxsize==front;
        }
        //添加數(shù)據(jù)
        public void addQueue(){
 
           if (isFull()){
               System.out.printf("隊(duì)列滿了");
           }
           else{
               System.out.printf("輸入添加的數(shù)據(jù)");
               int  data=scanner.nextInt();
               arry[rear]=data;
             if (rear<maxsize-1){
                 rear++;
             }
             else {
                 rear=(rear+1)%maxsize;
             }
 
           }
 
 
        }
        //取出數(shù)據(jù)
        public void getQueue(){
            if (isEmpty()){
                System.out.println("隊(duì)列是空的");
            }
            else{
                System.out.printf("取出數(shù)據(jù)%d",arry[front]);
//               arry[front]=0;
//                front++;
                front=(front+1)%maxsize;
 
            }
        }
        //顯示頭數(shù)據(jù)
        public int showHead() {
            if (isEmpty()) {
 
                throw new RuntimeException("隊(duì)列是空的");
            }
            return arry[front];
 
        }
    }

到此這篇關(guān)于java數(shù)組實(shí)現(xiàn)循環(huán)隊(duì)列示例介紹的文章就介紹到這了,更多相關(guān)java數(shù)組循環(huán)隊(duì)列內(nèi)容請(qǐng)搜索腳本之家以前的文章或繼續(xù)瀏覽下面的相關(guān)文章希望大家以后多多支持腳本之家！

您可能感興趣的文章: