创建自己的队列Queue底层实现利用数组

package queuearray;

import java.util.ArrayList;

import java.util.List;

public class QANode<T> {

private List<T> list;

public List<T> getList() {

return list;

}

public void setList(List<T> list) {

this.list = list;

}

public QANode(){

this.list=new ArrayList<T>();

}

public QANode(List<T> list, int front, int rear) {

super();

this.list = list;

}

}

package queuearray;

public class MyQueueByArray<T> {

private QANode<T> queue;

public QANode<T> getQueue() {

return queue;

}

public void setQueue(QANode<T> queue) {

this.queue = queue;

}

public MyQueueByArray(){

this.queue=new QANode<T>();

}

public MyQueueByArray(QANode<T> queue) {

super();

this.queue = queue;

}

//队列是否为空

public boolean isEmpty(){

return queue.getList().isEmpty();

}

//插入元素

public void offer(T data){

queue.getList().add(data);

}

//删除元素

public T take(){

return queue.getList().remove(0);

}

//队列中元素的个数

public int size(){

return queue.getList().size();

}

//将队列清除

public void clear(){

queue.getList().clear();

}

/**

* @param args

*/

public static void main(String[] args) {

MyQueueByArray<String> queue=new MyQueueByArray<String>();

queue.offer("a");

queue.offer("b");

queue.offer("c");

// queue.clear();

System.out.println(queue.size());

while(!queue.isEmpty()){

String v=queue.take();

System.out.print(v+" ");

}

System.out.println();

System.out.println(queue.size());

}

}