import java.util.LinkedList;
public class Queue {
LinkedList queue=null;
public Queue()
{
queue=new LinkedList();
}
public void isEmpty()
{
int temp=(Integer)queue.size();
if(temp<0)
{
System.out.println("队列为空");
}
}
public void put(int e)
{
queue.addLast(e);
}
public int getfront()
{
int temp=(Integer) queue.getFirst();
return temp;
}
public int getrear()
{
int temp=(Integer) queue.getLast();
return temp;
}
public void print()
{
System.out.println("队内元素为: "+queue.toString());
}
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Queue test=new Queue();
test.put(10);
test.put(2);
test.put(3);
test.put(4);
test.put(5);
test.print();
System.out.println("队首为: "+test.getfront());
System.out.println("队尾为: "+test.getrear());
}
}
循环队列——JAVA
最新推荐文章于 2022-04-03 16:41:24 发布