队列

来源：互联网发布：head first java 微盘编辑：程序博客网时间：2024/05/06 18:38

核心：先进先出

实现队列：

package ch04;public class Queue {// 数组private long[] arr;// 最大空间private int maxSize;// 有效元素大小private int elmes;// 对头private int font;// 队尾private int end;// 构造方法public Queue(int maxSize) {this.maxSize = maxSize;arr = new long[maxSize];elmes = 0;font = 0;end = -1;}// 插入数据public void insert(long value) {arr[++end] = value;elmes++;}// 移除数据public long remove() {elmes--;return (arr[font++]);}// 是否为空public boolean isEmpty() {return (elmes == 0);}// 是否满了public boolean isFull() {return (end == maxSize - 1);}// 返回有效元素大小public int size() {return maxSize;}public static void main(String[] args) {Queue queue = new Queue(5);System.out.println(queue.isEmpty());queue.insert(50);queue.insert(10);queue.insert(40);queue.insert(30);queue.insert(20);System.out.println(queue.isEmpty());System.out.println(queue.isFull());while (!queue.isEmpty()) {System.out.print(queue.remove() + " ");}System.out.println();System.out.println(queue.size());}}

0 0