c++ - 如何在不同的功能中使用队列？

Question

队列中的项目不断重置。在主菜单中选择“显示”功能后，如何显示队列中的所有项目？如果我在使用“添加项目”功能放置项目后选择显示功能，则不会显示我放置的项目。在主菜单中选择“显示”功能后，如何显示队列中的所有项目？

#include <iostream>
#include "linkedQueue.h"

using namespace std;

void mainMenu();
void addQueues();
void Display();

int main()
{
    mainMenu();
    system("pause>0");
    return 0;
}

void mainMenu()
{
    system("cls");
    int num;
    linkedQueueType<int> queue;
    cout << "\t\t\t OPERATIONS";
    cout << "\n\n  [1] Add items";
    cout << "\n  [2] Delete items";
    cout << "\n  [3] Show the number of items";
    cout << "\n  [4] Show min and max items";
    cout << "\n  [5] Find an item";
    cout << "\n  [6] Sort items";
    cout << "\n  [7] Print all items";
    cout << "\n  [8] Exit";

    cout << " \n\n Enter choice: ";
    cin >> num;
    switch (num)
    {
    case 1:

        int x;
        char ch;
        cout << "\nAdd number: ";
        cin >> x;
        queue.addQueue(x);
        cout << "Enter again? (Y/N)     ";
        cin >> ch;
        while (ch == 'Y')
        {
            cout << "\nAdd number: ";
            cin >> x;
            queue.addQueue(x);
            cout << "Enter again? (Y/N)     ";
            cin >> ch;
        }
        if (ch == 'N')
        {
            mainMenu();
        }
        break;

    case 7:

        cout << "Queue Elements: ";

        if (queue.isEmptyQueue())
            cout << "Queue is empty - add item first\n";
        else
        {
            while (!queue.isEmptyQueue())
            {
                cout << queue.front() << " ";
                queue.deleteQueue();
            }
        }

    break;

    default:
        cout << "Invalid" << endl;
    }
}

Answer 1

问题在于对 mainMenu() 函数的递归调用，因为队列被一次又一次地初始化。为了避免这种情况，您可以将 num 初始化为 0 作为 num=0 ，然后在 mainmenu() 中使用 while 循环并将代码放入 while 循环中

#include <iostream>
#include "linkedQueue.h"
using namespace std;
void mainMenu();
void addQueues();
void Display();

int main()
{
mainMenu();
system("pause>0");
return 0;
}

void mainMenu()
{
system("cls");
int num=0;
linkedQueueType<int> queue;
while(num!=8)
{
cout << "\t\t\t OPERATIONS";
cout << "\n\n  [1] Add items";
cout << "\n  [2] Delete items";
cout << "\n  [3] Show the number of items";
cout << "\n  [4] Show min and max items";
cout << "\n  [5] Find an item";
cout << "\n  [6] Sort items";
cout << "\n  [7] Print all items";
cout << "\n  [8] Exit";

cout << " \n\n Enter choice: ";
cin >> num;
switch (num)
{
case 1:

    int x;
    char ch;
    cout << "\nAdd number: ";
    cin >> x;
    queue.addQueue(x);
    cout << "Enter again? (Y/N)     ";
    cin >> ch;
    while (ch == 'Y')
    {
        cout << "\nAdd number: ";
        cin >> x;
        queue.addQueue(x);
        cout << "Enter again? (Y/N)     ";
        cin >> ch;
    }
    break;

case 7:

    cout << "Queue Elements: ";

    if (queue.isEmptyQueue())
        cout << "Queue is empty - add item first\n";
    else
    {
        while (!queue.isEmptyQueue())
        {
            cout << queue.front() << " ";
            queue.deleteQueue();
        }
    }

break;

default:
    cout << "Invalid" << endl;
}
}
}