队列顺序表实现班级人员管理

#define _CRT_SECURE_NO_WSRNINGS
#include<iostream>
#include<string>
#include<fstream>
using namespace std;
#define max 200

struct StudentMessage
{
    string ClassName;
    string sex;
    string StudentName;
    string StudentID;
};

struct SqQueue
{
    StudentMessage* m_Data;
    int m_Front;
    int m_Rear;
};

//init Function
int init_sqQueue(SqQueue& sqQueue)
{
    sqQueue.m_Data = new StudentMessage[max];
    if (!sqQueue.m_Data)
    {
        cout << "the member is full " << endl;
        return 0;
    }
    sqQueue.m_Front = sqQueue.m_Rear = 0;
    return 1;
}
//enqueue Function 
int En_Quenue(SqQueue& sqQueue, StudentMessage  data)
{
    if ((sqQueue.m_Rear + 1) % max == sqQueue.m_Front)
    {
        cout << "queue is full" << endl;
        return 0;
    }
    sqQueue.m_Data[sqQueue.m_Rear].ClassName= data.ClassName;
    sqQueue.m_Data[sqQueue.m_Rear].sex = data.sex;
    sqQueue.m_Data[sqQueue.m_Rear].StudentID = data.StudentID;
    sqQueue.m_Data[sqQueue.m_Rear].StudentName = data.StudentName;
    sqQueue.m_Rear = (sqQueue.m_Rear + 1) % max;
    return 1;
}

void Get_Head(SqQueue& sqQueue)
{
    if (sqQueue.m_Front != sqQueue.m_Rear)
    {
        cout << sqQueue.m_Data[sqQueue.m_Front].ClassName << " " << sqQueue.m_Data[sqQueue.m_Front].sex << " " <<
            sqQueue.m_Data[sqQueue.m_Front].StudentID << " " << sqQueue.m_Data[sqQueue.m_Front].StudentName << endl;
    }
    else
    {
        cout << "the queue is empty" << endl;
    }

}
//DEqueue Function
int De_queue(SqQueue& sqQueue, StudentMessage& newStu)
{
    if (sqQueue.m_Front == sqQueue.m_Rear)
    {
        cout << "queue is empty " << endl;
        return 0;
    }
    else
    {
        newStu.ClassName = sqQueue.m_Data[sqQueue.m_Front].ClassName;
        newStu.sex = sqQueue.m_Data[sqQueue.m_Front].sex;
        newStu.StudentID = sqQueue.m_Data[sqQueue.m_Front].StudentID;
        newStu.StudentName = sqQueue.m_Data[sqQueue.m_Front].StudentName;
        sqQueue.m_Front = (sqQueue.m_Front + 1) % max;
        return 1;
    }
    
}

void Sqque_homework()
{
    cout << "*****************Squeuce Function *****************" << endl;
    cout << "***********1.Init    ****************" << endl;
    cout << "***********2.Enqueue ****************" << endl;
    cout << "***********3.Get Head****************" << endl;
    cout << "***********4.Dequeue ****************" << endl;
    cout << "***********0.Quit    ****************" << endl;
    int choose = -1, flag = 0;
    SqQueue myQueue;
    while (choose != 0)
    {
        cout << "Please input your choose :" << endl;
        cin >> choose;
        switch (choose)
        {
        case 1://init 
        {
            if (init_sqQueue(myQueue))
            {
                flag = 1;
                cout << "init success " << endl;
            }
            else
            {
                cout << "init fail " << endl;
            }
        }
        break;

        case 2:
        {
            if (flag)
            {
                flag = 1;
                string FileName;
                cout << "Please input fileName " << endl;
                cin >> FileName;
                fstream ifs;
                ifs.open(FileName, ios::in);
                if (!ifs)
                {
                    cout << "File open Fail" << endl;

                }
                while (!ifs.eof())
                {
                    StudentMessage newData;
                    ifs >> newData.ClassName >> newData.sex >> newData.StudentID >> newData.StudentName;
                    En_Quenue(myQueue, newData);

                }
                cout << "the message is loaded in" << endl;
                cout << "the rear is " << myQueue.m_Data[myQueue.m_Rear].StudentName << endl;
                ifs.close();
            }
        }
        break;

        case 3://get  head data
        {
            if (flag != -1 && flag != 0)
            {
                cout << "the head data is " << endl;
                Get_Head(myQueue);
            }
        }
        break;
        case 4:
        {
            if (flag == 1 && myQueue.m_Front != myQueue.m_Rear)
            {
                cout << " the data dequeued is " << endl;
                StudentMessage newData;
                while (De_queue(myQueue, newData))
                {
                    flag = -1;
                    cout << " the data dequeue is " << newData.ClassName << " "
                        << newData.sex << " " << newData.StudentID << " " << newData.StudentID << " " << newData.StudentName << endl;
                }
            }
            else
            {
                cout << "the list is empty !" << endl;
            }
        }
        break;
        default:
            break;

        }
    }
}

int main()
{
    Sqque_homework();
    system("pause");
    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值