数据结构之队列——Java实现

数据结构之队列——Java实现

队列是一种特殊的线性表，特殊之处在于它只允许在表的前端（head）进行删除操作，而在表的后端（tail）进行插入操作，和栈一样，队列是一种操作受限制的线性表。进行插入操作的端称为队尾，进行删除操作的端称为队头。
代码如下

import java.util.Scanner;

class DATA{
    String name;
    int age;
}

class SQType{
    static final int QUEUELEN = 15;
    DATA[] data = new DATA[QUEUELEN];
    int head;
    int tail;

    SQType SQTypeInit(){
        SQType q;

        if ((q = new SQType()) != null){
            q.head = 0;
            q.tail = 0;
            return q;
        }else {
            return null;
        }
    }

    int SQTypeIsEmpty(SQType q){
        int temp = 0;
        if (q.head == q.tail)
            temp = 1;
        return temp;
    }

    int SQTypeIsFull(SQType q){
        int temp = 0;
        if(q.tail == QUEUELEN)
            temp = 1;
        return  temp;
    }

    void SQTypeIsClear(SQType q){
        q.tail = 0;
        q.head = 0;
    }

    void SQTypeIsFree(SQType q){
        if (q != null){
            q = null;
        }
    }

    int InSQType(SQType q,DATA data){
        if(q.tail == QUEUELEN){
            System.out.println("队列已满！操作失败！");
            return 0;
        }else {
            q.data[q.tail++] = data;
            return 1;
        }
    }

    DATA OutSQType(SQType q){
        if (q.head == q.tail){
            System.out.println("队列已空！操作失败！");
            System.exit(0);
        }else {
            return q.data[q.head++];
        }
        return null;
    }

    DATA PeekSQType(SQType q){
        if (SQTypeIsEmpty(q) ==1){
            System.out.println("空队列");
            return null;
        }else{
            return q.data[q.head];
        }
    }

    int SQTypeLen(SQType q){
        int temp = q.tail - q.head;
        return temp;
    }
}

public class Main {

    public static void main(String[] args) {
        SQType sqType = new SQType();
        DATA data;
        Scanner sc = new Scanner(System.in);
        SQType stack = sqType.SQTypeInit();
        System.out.println("入队操作：");
        System.out.println("输入姓名 年龄进行入队操作");
        do {
            DATA data1 = new DATA();
            data1.name = sc.next();
            data1.age = sc.nextInt();
            if (data1.name.equals("0"))
                break;
            else
                sqType.InSQType(stack,data1);
        }while (true);

        String temp = "1";
        System.out.println("出队操作：按任意非0键进行出队操作：");
        temp = sc.next();
        while (!temp.equals("0")){
            data = sqType.OutSQType(stack);
            System.out.println("出队的数据是"+data.name+","+data.age);
            temp = sc.next();
        }
        System.out.println("测试结束！");
        sqType.SQTypeIsFree(stack);
    }
}

测试结果