算法_数据结构_队列

import java.util.Queue;

/**
 * @Author
 * @Date
 */
public class QueueNode {
    public int [] queueData;
    public int head;
    public int tail;
    public static int MAX_LENGTH_QUEUE;
    public QueueNode(int length){
        MAX_LENGTH_QUEUE = length;

    }

    public void initQueue(){
        this.queueData = new int[MAX_LENGTH_QUEUE];
        this.head = 0;
        this.tail = 0;
    }

    public boolean isEmptyQueue(QueueNode q){
        if(q.head == q.tail){
            return true;
        }
        return false;
    }

    public boolean isFullQueue(QueueNode q){
        if(q.head == MAX_LENGTH_QUEUE){
            return true;
        }
        return false;
    }

    public void clearQueue(QueueNode q){
        q.head = 0;
        q.tail = 0;
    }

    public void setFreeQueue(QueueNode q){
       if(q != null){
           q = null;
       }
    }

    public void inQueue(QueueNode q,int data){
        if (q.tail == MAX_LENGTH_QUEUE){
            System.out.println("队列已满!");
        }else{
            q.queueData[q.tail++] = data;
        }
    }

    public int outQueue(QueueNode q){
        if(q.head == q.tail){
            System.out.println("队列已经空!");
        }else{
            return q.queueData[q.head++];
        }
        return 0;
    }
}