队列
ArrayQueue类
class ArrayQueue{
private int maxSize;
private int front;
private int rear;
private int[] queue;
public ArrayQueue(int maxSize) {
this.maxSize = maxSize;
this.front = -1;
this.rear = -1;
this.queue = new int[maxSize];
}
public boolean isFull(){
return rear == maxSize - 1;
}
public boolean isEmpty(){
return rear == front;
}
public void addQueue(int n){
if (isFull()){
System.out.println("队列已满,不能再加数据!");
return;
}
rear ++;
queue[rear] = n;
}
public int getQueue(){
if (isEmpty()){
throw new RuntimeException("队列为空,不能取数据!");
}
front ++;
return queue[front];
}
public void showQueue(){
if (isEmpty()){
System.out.println("队列为空,没有数据!");
return;
}
for (int i = front + 1; i <= rear; i++) {
System.out.printf("queue[%d] = %d\n", i, queue[i]);
}
}
public int headQueue(){
if (isEmpty()){
throw new RuntimeException("队列为空,没有数据!");
}
return queue[front + 1];
}
}
测试代码
public static void main(String[] args) {
ArrayQueue queue = new ArrayQueue(3);
char key = ' ';
Scanner scanner = new Scanner(System.in);
boolean loop = true;
while (loop){
System.out.println("s(show):显示队列");
System.out.println("e(exit):退出程序");
System.out.println("a(add):添加数据到队列");
System.out.println("g(get):从队列取出数据");
System.out.println("h(head):查看队列头的数据");
key = scanner.next().charAt(0);
switch (key){
case 's':
queue.showQueue();
break;
case 'a':
System.out.println("请输入一个数");
queue.addQueue(scanner.nextInt());
break;
case 'g':
try {
int res = queue.getQueue();
System.out.printf("取出的数据是%d\n",res);
} catch (Exception e) {
System.out.println(e.getMessage());
}
break;
case 'h':
try {
int res = queue.headQueue();
System.out.printf("队列头的数据是%d\n",res);
} catch (Exception e) {
System.out.println(e.getMessage());
}
break;
case 'e':
scanner.close();
loop = false;
break;
default:
break;
}
}
System.out.println("程序退出!");
}
存在的问题
环形队列
CircleQueue类
class CircleQueue {
private int maxSize;
private int front;
private int rear;
private int[] queue;
public CircleQueue(int maxSize) {
this.maxSize = maxSize + 1;
this.front = 0;
this.rear = 0;
this.queue = new int[maxSize + 1];
}
public boolean isFull() {
return (rear + 1) % maxSize == front;
}
public boolean isEmpty() {
return rear == front;
}
public void addQueue(int n) {
if (isFull()) {
System.out.println("队列已满,不能再加数据!");
return;
}
queue[rear] = n;
rear = (rear + 1) % maxSize;
}
public int getQueue() {
if (isEmpty()) {
throw new RuntimeException("队列为空,不能取数据!");
}
int head = queue[front];
front = (front + 1) % maxSize;
return head;
}
public void showQueue() {
if (isEmpty()) {
System.out.println("队列为空,没有数据!");
return;
}
for (int i = front; i < front + size(); i++) {
System.out.printf("queue[%d] = %d\n", i, queue[i % maxSize]);
}
}
public int size() {
return (rear + maxSize - front) % maxSize;
}
public int headQueue() {
if (isEmpty()) {
throw new RuntimeException("队列为空,没有数据!");
}
return queue[front];
}
}
测试代码
public static void main(String[] args) {
CircleQueue queue = new CircleQueue(4);
char key = ' ';
Scanner scanner = new Scanner(System.in);
boolean loop = true;
while (loop) {
System.out.println("s(show):显示队列");
System.out.println("e(exit):退出程序");
System.out.println("a(add):添加数据到队列");
System.out.println("g(get):从队列取出数据");
System.out.println("h(head):查看队列头的数据");
key = scanner.next().charAt(0);
switch (key) {
case 's':
queue.showQueue();
break;
case 'a':
System.out.println("请输入一个数");
queue.addQueue(scanner.nextInt());
break;
case 'g':
try {
int res = queue.getQueue();
System.out.printf("取出的数据是%d\n", res);
} catch (Exception e) {
System.out.println(e.getMessage());
}
break;
case 'h':
try {
int res = queue.headQueue();
System.out.printf("队列头的数据是%d\n", res);
} catch (Exception e) {
System.out.println(e.getMessage());
}
break;
case 'e':
scanner.close();
loop = false;
break;
case 'b':
System.out.println("当前队列长度为" + queue.size());
break;
default:
break;
}
}
System.out.println("程序退出!");
}