java数据结构和算法------队列

// 普通队列
package iYou.neugle.list;

public class MySeqQueue<T> {
    private SeqQueue queue = new SeqQueue();

    class SeqQueue {
        public int maxSize = 10;
        public T[] data = (T[]) new Object[this.maxSize];
        public int head = 0;// 头指针
        public int tail = 0;// 尾指针
    }

    // 初始化队列
    public void SeqQueueInit() {
        this.queue.head = 0;
        this.queue.tail = 0;
        System.out.println("队列初始化成功!");
    }

    // 出队
    public T SeqQueueOut() {
        if (this.queue.head == this.queue.tail) {
            System.out.println("队列已空,无法出队!");
            return null;
        }
        T data = this.queue.data[this.queue.head];
        this.queue.data[this.queue.head] = null;
        this.queue.head++;
        return data;
    }

    // 入队
    public void SeqQueueIn(T data) {
        if (this.queue.tail == this.queue.maxSize) {
            System.out.println("队列已满,无法入队!");
            return;
        }
        this.queue.data[this.queue.tail++] = data;
    }

    // 获取队头元素
    public T SeqQueuePeek() {
        if (this.queue.head == this.queue.tail) {
            System.out.println("队列已空,无法获取列头元素!");
            return null;
        }

        return this.queue.data[this.queue.head];
    }

    // 获取队列长度
    public int SeqQueueLen() {
        return this.queue.tail - this.queue.head;
    }
}

// 循环队列
package iYou.neugle.list;

public class MySeqLoopQueue<T> {
    private SeqQueue queue = new SeqQueue();

    class SeqQueue {
        public int maxSize = 10;
        public T[] data = (T[]) new Object[this.maxSize];
        public int head = 0;// 头指针
        public int tail = 0;// 尾指针
        public int size = 0;// 实际数
    }

    // 初始化队列
    public void SeqQueueInit() {
        this.queue.head = 0;
        this.queue.tail = 0;
        this.queue.size = 0;
        System.out.println("循环队列初始化成功!");
    }

    // 出队
    public T SeqQueueOut() {
        if (this.queue.size == 0) {
            System.out.println("循环队列已空,无法出队!");
            return null;
        }
        T data = this.queue.data[this.queue.head];
        this.queue.data[this.queue.head] = null;
        this.queue.size--;
        this.queue.head = (this.queue.head + 1) % this.queue.maxSize;
        return data;
    }

    // 入队
    public void SeqQueueIn(T data) {
        if (this.queue.size == this.queue.maxSize) {
            System.out.println("循环队列已满,无法入队!");
            return;
        }
        this.queue.data[this.queue.tail] = data;
        this.queue.size++;
        this.queue.tail = (this.queue.tail + 1) % this.queue.maxSize;
    }

    // 获取队头元素
    public T SeqQueuePeek() {
        if (this.queue.size == 0) {
            System.out.println("循环队列已空,无法获取列头元素!");
            return null;
        }

        return this.queue.data[this.queue.head];
    }

    // 获取队列长度
    public int SeqQueueLen() {
        return this.queue.size;
    }
}