Java用接口实现队列

package com.ltl.test;

public interface MyQueue {
	public boolean isEmpty();
	public boolean isFull();
	public void add(int num);
	public int delete();
	public void show();
	public int count();

}
package com.ltl.test;

public class Queue implements MyQueue {
	private int maxsize;
	private int front;
	private int rear;
	private int[] array;
	
	public Queue(int size) {
		maxsize=size;
		array=new int[maxsize];
		front=0;
		rear=0;
	}

	@Override
	public boolean isEmpty() {
		// TODO Auto-generated method stub
		return front==rear;
	}

	@Override
	public boolean isFull() {
		// TODO Auto-generated method stub
		return (rear+1) % maxsize == front;
	}

	@Override
	public void add(int num) {
		if(isFull()) {
			System.out.println("队列已满");
		}
		array[front]=num;
		rear=(rear+1)%maxsize;
	}

	@Override
	public int delete() {
		// TODO Auto-generated method stub
		if(isEmpty()) {
			System.out.println("队列为空");
		}
		int value=array[front];
		front=(front+1)%maxsize;
		return value;
	}

	@Override
	public void show() {
		if(isEmpty()) {
			System.out.println("队列为空");
		}
		for (int i = front; i < front+count(); i++) {
			System.out.printf("array[%d]=%d\n",i % maxsize,array[i%maxsize]);
		}
	}
	
	@Override
	public int count() {
		// TODO Auto-generated method stub
		return (rear-front+maxsize) % maxsize;
	}

}
package com.ltl.test;
import java.util.Scanner;
public class QueueTest {
	private static Scanner scanner=new Scanner(System.in);
	static Queue queue=new Queue(5);
	public static void main(String[] args) {
		homePage();
	}
	private static void homePage() {
		String tip=("1.入队\n"
				+"2.出队\n"
				+"3.显示\n"
				+"0.退出");
		System.out.println(tip);
		int input=scanner.nextInt();
		switch (input) {
		case 1:
			addPage();
			break;
		case 2:
			deletePage();
			break;
		case 3:
			showPage();
			break;
		case 0:
			exitPage();
			break;
		default:
			ErrorPage();
			break;
		}
	}

	private static void ErrorPage() {
		System.out.println("您的输入有误,请重新输入!");
		homePage();
	}
	private static void exitPage() {
		System.out.println("感谢使用,欢迎再来!");
		
	}
	private static void deletePage() {
		int pop = queue.delete();
		System.out.println("出队的值是:" + pop);
		System.out.println("出队成功!");
		homePage();
	}
	private static void showPage() {
		queue.show();
		System.out.println("显示成功!");
		homePage();
	}
	private static void addPage() {
		System.out.println("请输入要入队的数据:");
		int val=scanner.nextInt();
		queue.add(val);
		System.out.println("入队成功");
		homePage();
	}

}

  • 0
    点赞
  • 3
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值