java堆

package a1;

import java.util.ArrayList;
import java.util.LinkedList;

public class MyQueue
{
   //private LinkedList ll=new LinkedList();
	private ArrayList ll=new ArrayList();
 //出队
 public Object poll()
 {
	// return ll.removeFirst();
	 return ll.remove(0);
 }
 //入队
 public void offer(Object o)
 {
	//ll.addLast(o);
	 ll.add(o);
 }
 //查看队头
 public Object peek()
 {
	 //return ll.peekLast();
	 return ll.get(0);
 }
 //判断为空?
 public boolean ismpty()
 {
	 return ll.isEmpty();
 }
}

 

package a1;

public class QueueTest
{

	/**
	 * @param args
	 */
	public static void main(String[] args)
	{
		// TODO Auto-generated method stub
		MyQueue mq=new MyQueue();
		mq.offer(1);
		mq.offer(2);
		mq.offer(3);
		mq.offer(4);
		mq.offer(5);
		mq.offer(6);
		while(!mq.ismpty())
		{
			System.out.println(mq.poll());
		}
		

	}

}