队列 Java

import java.util.Arrays;

/**
 * Created by zhu on 2018/3/24.
 */
public class Duilie<T> {//队列
    public static void main(String[] args) {
        Duilie<String> duilie=new Duilie<String>();
        duilie.add("aaa");
        duilie.add("bbb");
        duilie.add("cccc");
        duilie.add("dddd");
        System.out.println(duilie);
        duilie.remove();
        System.out.println(duilie);
        System.out.println(duilie.element());
        duilie.clear();
        System.out.println(duilie);
    }
    private int DEFAULT_SIZE=10;//默认长度
    private int capacity;//数组长度
    private Object [] ele;
    private int front=0;//出
    private int rear=0;//进
    public Duilie(){
        capacity=DEFAULT_SIZE;
        ele=new Object[capacity];
    }
    //获取长度
    public int length(){
        return rear-front;
    }
    //插入队列
    public void add(T element){
        if (rear>capacity-1){
            throw  new IndexOutOfBoundsException("队列已满");
        }
        ele[rear++]=element;
    }
    //移除队列，并返回移除元素
    public T remove(){
        if (empty()){
            throw  new IndexOutOfBoundsException("空队列异常");
        }
        T oldvalue= (T) ele[front];
        ele[front++]=null;
        return oldvalue;
    }
    //返回队列顶部元素
    public T element(){
        if (empty()){
            throw  new IndexOutOfBoundsException("空队列异常");
        }
        return (T) ele[front];
    }

    public boolean empty() {//判断是否为空
        return rear==front;
    }
    //清空顺序队列
    public void clear(){
        Arrays.fill(ele,null);//将ele数组全部填为null
        front=0;
        rear=0;
    }
    public String toString(){
        if (empty()){
            return "[]";
        }else {
            StringBuilder sb=new StringBuilder("[");
            for (int i=front;i<rear-1;i++){
                sb.append(ele[i].toString()+",");
            }
            sb.append(ele[rear-1].toString());
            return sb.append("]").toString();
        }
    }

}