02java演算法與資料結構------佇列用陣列程式碼實現
阿新 • • 發佈:2021-11-14
1 package com.java.test; 2 3 import java.util.Scanner; 4 5 public class Test2 { 6 public static void main(String[] args) { 7 //佇列用陣列來實現 8 Scanner sc = new Scanner(System.in); 9 System.out.println("請你輸入佇列的最大值"); 10 int maxSize=sc.nextInt(); 11 int[] arr = newint[maxSize]; 12 //佇列的尾; 13 int rear=-1; 14 //佇列的頭; 15 int front=-1; 16 //佇列用陣列來實現 ---給陣列新增值 17 while (true){ 18 System.out.println("請你新增陣列的值"); 19 int count=sc.nextInt(); 20 rear++; 21 arr[rear]=count; 22 if(rear == maxSize-1) { 23 System.out.println("請你新增陣列的值已經滿了"); 24 break; 25 } 26 } 27 //佇列用陣列來實現 ---給陣列新增值-----遍歷 28 for (int i = 0; i <arr.length ; i++) { 29 if (front == rear) { 30 System.out.println("該陣列為空");31 break; 32 } 33 System.out.println(arr[i]); 34 } 35 } 36 }