學習java資料結構基礎知識之隊列

標籤：java資料結構   資料結構   隊列   

隊列是先進先出。

利用java語言實現隊列代碼：

/* * 隊列 */public class Queue {private int maxSize;          //最大隊列private long[] queArray;      //隊列數組private int front;            //隊頭private int rear;             //隊尾private int nItems;           //當前隊列元素個數//建構函式public Queue(int s) {super();this.maxSize = s;this.queArray = new long[maxSize];this.front = 0;this.rear = -1;this.nItems = 0;}//插入元素public void insert(long j){if(rear ==(maxSize-1)){rear =-1;}queArray[++rear] =j;nItems++;}//刪除元素public long remove(){long temp =queArray[front++];if (front ==maxSize) {front =0;}nItems--;return temp;}//隊列頭public long peekFront() {return queArray[front];}//隊列是否為空白public boolean isEmpty(){return (nItems ==0);}//隊列是否滿了public boolean isFull() {return(nItems==maxSize);}//隊列長度public int size() {return nItems;}}

<pre name="code" class="java">public class QueueApp {public static void main (String[] arg) {Queue theQueue =new Queue(5);theQueue.insert(10);theQueue.insert(20);theQueue.insert(30);theQueue.insert(40);theQueue.remove();theQueue.remove();theQueue.remove();theQueue.insert(50);theQueue.insert(60);theQueue.insert(70);theQueue.insert(80);while (!theQueue.isEmpty()) {long n = theQueue.remove();System.out.print(n);System.out.print("  ");}System.out.print(" ");}}

學習java資料結構基礎知識之隊列