queueapp.java

java 数据结构的一些简单实例和一些线程的应用主要是面向初学者

class Queue {
	 private int[] a;
	 private int item;
	 private int rear;
	 private int front;
	 private int maxsize;
	 
	 public Queue(int max){
		 maxsize=max;
		 item=0;
		 rear=-1;
		 front=0;
		 a=new int[max];
	 }
	 public void insert(int value){
		 if(rear==maxsize)
			 rear=-1;
		 a[++rear]=value;
		 item++;
	 }
	 public int remove(){
		  int temp=a[front++];
		  if(front==maxsize)
			  front=0;
		  item--;
		  return temp;
	 }
	 public int peek(){
		 return a[front];
	 }
	 public boolean isfull(){
		 return (item==maxsize);
	 }
	 public int size(){
		 return item;
	 }
	 public boolean isempty(){
		 return (item==0);
	 }
}
 
 
 public class QueueApp{
	 public static void main(String[] args){
	 int max=100;
	 Queue q=new Queue(max);
	 q.insert(23);
	 q.insert(34);
	 q.insert(45);
	 q.insert(45);
	 
	 q.remove();
	 q.remove();
	 q.remove();
	 
	 q.insert(78);
	 q.insert(65);
	 while(!q.isempty())
	 {
		 int n=q.remove();
		 System.out.println(n);
	 }
	
	 }
	
 }