Java编程:用数组实现队列的存取
2007-12-20 23:28
141 查看
Java编程:用数组实现队列的存取,在JCreator4.0中运行成功!
/**
* @(#)Queue01.java
*Java编程:用数组实现队列的存取
*
* @author kemwin
* @version 1.00 2007/12/20
*/
import java.io.*;
public class Queue01 {
static class QueueArray{
int MaxSize = 10;
int[] AQueue = new int[MaxSize];
int Front = -1;
int Rear = -1;
//----------------------
//print out the data
//----------------------
public void Print(){
int i;
System.out.print("The Queue Content;");
for(i=Front+1;i<Rear+1;i++)
System.out.print("["+AQueue[i]+"]");
System.out.println("");
}
//-----------------------
//save the queue data
//-----------------------
public void AddQueue(int Value){
int i;
if(Rear >=MaxSize)
System.out.println("The Queue is full!");
else{
Rear++;
AQueue[Rear]=Value;
}
}
//-------------------------
//call out the data
//-------------------------
public int DelQueue()
{
int Temp;
if( Front == Rear ){
System.out.println("The stack is empty!!");
return -1;
}
Front++;
Temp = AQueue[Front];
return Temp;
}
}
/**
* Creates a new instance of <code>Queue01</code>.
*/
/**
* @param args the command line arguments
*/
public static void main(String[] args)throws IOException {
// TODO code application logic here
int Select;
QueueArray Queue01 = new QueueArray();
int i;
int Value;
do{
System.out.println("1.Input a queue data");
System.out.println("2.Output a queue data");
System.out.println("3.Exit");
System.out.print("please select one=>");
//
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String str = br.readLine();
Select=Integer.parseInt(str);
//
switch(Select){
case 1:
System.out.print("Please input the data=>");
BufferedReader br2=new BufferedReader(new InputStreamReader(System.in));
String str2 = br2.readLine();
Value = Integer.parseInt(str2);
Queue01.AddQueue(Value);
Queue01.Print();
System.out.println("");
break;
case 2:
Value =Queue01.DelQueue();
Queue01.Print();
System.out.println("");
break;
}
}while(Select !=3);
}
}
/**
* @(#)Queue01.java
*Java编程:用数组实现队列的存取
*
* @author kemwin
* @version 1.00 2007/12/20
*/
import java.io.*;
public class Queue01 {
static class QueueArray{
int MaxSize = 10;
int[] AQueue = new int[MaxSize];
int Front = -1;
int Rear = -1;
//----------------------
//print out the data
//----------------------
public void Print(){
int i;
System.out.print("The Queue Content;");
for(i=Front+1;i<Rear+1;i++)
System.out.print("["+AQueue[i]+"]");
System.out.println("");
}
//-----------------------
//save the queue data
//-----------------------
public void AddQueue(int Value){
int i;
if(Rear >=MaxSize)
System.out.println("The Queue is full!");
else{
Rear++;
AQueue[Rear]=Value;
}
}
//-------------------------
//call out the data
//-------------------------
public int DelQueue()
{
int Temp;
if( Front == Rear ){
System.out.println("The stack is empty!!");
return -1;
}
Front++;
Temp = AQueue[Front];
return Temp;
}
}
/**
* Creates a new instance of <code>Queue01</code>.
*/
/**
* @param args the command line arguments
*/
public static void main(String[] args)throws IOException {
// TODO code application logic here
int Select;
QueueArray Queue01 = new QueueArray();
int i;
int Value;
do{
System.out.println("1.Input a queue data");
System.out.println("2.Output a queue data");
System.out.println("3.Exit");
System.out.print("please select one=>");
//
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String str = br.readLine();
Select=Integer.parseInt(str);
//
switch(Select){
case 1:
System.out.print("Please input the data=>");
BufferedReader br2=new BufferedReader(new InputStreamReader(System.in));
String str2 = br2.readLine();
Value = Integer.parseInt(str2);
Queue01.AddQueue(Value);
Queue01.Print();
System.out.println("");
break;
case 2:
Value =Queue01.DelQueue();
Queue01.Print();
System.out.println("");
break;
}
}while(Select !=3);
}
}
相关文章推荐
- 【C++数据结构】数组循环队列的实现
- 循环队列Queue--使用顺序存储结构(数组)实现
- Java实现 数组实现队列
- 使用数组实现队列----《数据结构与算法分析---C语言描述》
- jedis实现redis的消息队列、发布对象消息、字节数组与字符串相互转换
- 队列的循环数组实现
- 队列-数组实现
- Java编程用两个栈实现队列代码分享
- 编程珠玑: 14章 堆 14.2实现一个优先级队列,返回数组中最小值 -------解题总结
- C++用数组实现栈和循环队列
- 数据结构循环队列,数组实现,循环队列中如果不使用数据项计数字段items,而是通过front和rear计算队列是否为空或满或队列个数,那会很复杂
- Java小程序之自定义数组队列的实现(高级画板重绘基础)
- 面试题之两个栈实现一个队列,乘机数组问题
- 队列的数组实现和链式实现
- 【算法导论】10.1-5单数组实现双端队列
- 队列的数组实现
- 队列(数组形式)实现_c++
- java编程实现优先队列的二叉堆代码分享
- 数组实现队列
- [Algorithms]简单的栈与队列数组实现