算法C++ 先进先出队列银行排号系统STL库实现（第一章）

最新推荐文章于 2022-05-26 08:51:46 发布

Love 6

最新推荐文章于 2022-05-26 08:51:46 发布

阅读量630

点赞数

分类专栏：从c++开始的进步之路 # 算法（第四版）C++代码实现（已完结）文章标签： C++ 算法队列银行系统模拟

本文链接：https://blog.csdn.net/qq_37500516/article/details/115470769

版权

从c++开始的进步之路同时被 2 个专栏收录

561 篇文章 50 订阅

订阅专栏

算法（第四版）C++代码实现（已完结）

40 篇文章 32 订阅

订阅专栏

造轮子博客链接

算法第四版C++算法实现全集

代码实现

#include <iostream>
#include <queue>
using namespace std;

int main()
{
    int temp,customers_count = 0;
    unsigned maxnumber = 10;//今天银行只接待10个人
    queue<int> number_line;
    cout<<"bank only receive "<<maxnumber<<" people today"<<endl;
    cout<<"customers over maxnumber or input '-1' stop serving"<<endl;
    cout<<"input ur number"<<endl;
    while(cin>>temp)
    {
        if(temp == -1 || number_line.size() == maxnumber)
        {
            if(number_line.size() == maxnumber) cout<<"sorry the customers are too many!please next day comes!"<<endl;
            break;
        }
        number_line.push(temp);
    }
    while(!number_line.empty())
    {
        int customers_number = number_line.front();
        cout<<"the "<<customers_count++<<"th customer is number "<<customers_number<<endl;
        number_line.pop();
    }
    return 0;
}