在特定点插入数组

Question

我正在尝试将元素插入到数组的前面和后面以排序模拟优先级列表，其中以高优先级输入的任务放在顶部但底层的优先级低的任务。我的问题是代码适用于插入顶部或底部但不显示输入的中间值。我在某处覆盖了这些值吗？

我限制我可以使用的头文件。我本来可以用矢量完成这件事

感谢您给予的任何帮助。

下面是我的代码：

#include <iostream>
#include <string>
#include <math.h>

using namespace std;

void storeinfo() ;
void showinfo() ;
void menu() ;
void deleteinfo() ;
void inserttask() ;
void displayallinfo() ;
void selectionSort() ;
void inserttop(string) ;
void insertbottom(string) ;
int linsearch(string val) ;


class user 
{
    string firstname, lastname, currentteam, position, status ;
    int age ;
public:
    user() {};
    user(string fname, string lname, string cteam, string pos, string stat, int age) 
    {
        setFirstName(fname);
        setLastName(lname);
        setCurrentTeam(cteam);
        setPosition(pos);
        setStatus(stat);
        setAge(age);
    } ;

    void setFirstName(string fname)
        {firstname = fname;}
    void setLastName(string lname)
        {lastname = lname;}
    void setCurrentTeam(string cteam)
        {currentteam = cteam;}
    void setPosition(string pos)
        {position = pos;}
    void setStatus(string stat)
        {status = stat;}
    void setAge(int _age)
        {age = _age;}

    string getFirstName()
        {return firstname ;}
    string getLastName()
        {return lastname ;}
    string getCurrentTeam()
        {return currentteam ;}
    string getPosition()
        {return position ;}
    string getStatus()
        {return status ;}
    int getAge()
        {return age ;}
};

user player[20] ;
int arrlength = 3 ;
string list[6] ;
int listlength = 6;

int main()
{
    menu() ;

    cin.get() ;
    return 0 ;
}

void storeinfo()
{
    string firstname ;
    string lastname ;
    string currentteam ;
    string position;
    string status ;
    int age ;

    for (int i=0; i < 3; i++)
    {
        cout << "\n\n Enter First Name : " ; 
        cin >> firstname ;
        player[i].setFirstName(firstname) ;
        cout << "Enter Last Name : " ; 
        cin >> lastname ;
        player[i].setLastName(lastname) ;
        cout << "Enter Player's Age : " ; 
        cin >> age;
        player[i].setAge(age) ;
        cout << "Enter Current Team : " ; 
        cin >> currentteam ;
        player[i].setCurrentTeam(currentteam) ;
        cout << "Enter Position : " ; 
        cin >> position ;
        player[i].setPosition(position) ;
        cout << "Enter Status : " ; 
        cin >> status ;
        player[i].setStatus(status) ;

        cout << "\n\n\n" ;
    }

    /*cout << string(50, '\n');*/

    menu() ;

}

void showinfo()
{
    string search;
    int found ;


    cout << "Please Enter The Player's Last Name : " ;
    cin >> search ;

    found=linsearch(search);

    if (found==-1)
    {
        cout << "\n There is no player called " << search ;
    }
    else
    {
        cout << "\n First Name : " << player[found].getFirstName() << "\n" << "Last Name : " << player[found].getLastName() <<
            "\n" << "Age : " << player[found].getAge() << "\n" << "Current Team : " << player[found].getCurrentTeam() << 
            "\n" << "Position : " << player[found].getPosition() << "\n" << "Status :  " << player[found].getStatus()  << "\n\n";
    }

    cin.get() ;

    menu() ;

}

void deleteinfo()
{
    int arrlength = 3 ;
    string search ;
    int found ;

    cout << "\n Delete A Player's Information \n\n" ;
    cout << "Please Enter The Player's Last Name : " ;
    cin >> search ;

        found=linsearch(search);

    if (found==-1)
    {
        cout << "\n There is no player called " << search ;
    }
    else
    {
        for (int i=found + 1; i < arrlength; ++i)
        {
            player[i-1].setFirstName(player[i].getFirstName()) ;
            player[i-1].setLastName(player[i].getLastName()) ;
            player[i-1].setAge(player[i].getAge()) ;
            player[i-1].setCurrentTeam(player[i].getCurrentTeam()) ;
            player[i-1].setPosition(player[i].getPosition()) ;
            player[i-1].setStatus(player[i].getStatus()) ;
        }

        --arrlength ;

        cout << "\n Player has been deleted." ;

        player[arrlength].setAge(0) ;
        player[arrlength].setCurrentTeam("") ;
        player[arrlength].setFirstName("") ;
        player[arrlength].setLastName("") ;
        player[arrlength].setPosition("") ;
        player[arrlength].setStatus("");
    }

    cin.get() ;

    menu() ;
}

void displayallinfo()
{

    for (int index = 0; index < arrlength -1; index++) // sorting algorithm,
        {
            if (player[index].getAge() > player[index+1].getAge())
            {
                user temp; // create temporary user
                temp = player[index]; // position is set to temp
                player[index] =  player[index+1]; // swap takes place
                player[index+1] =  temp; // new value is what was stored in temp
            }
        }


    for (int i=0; i < 3; i++) //display all
    {
        cout << "\nFirst Name : " << player[i].getFirstName() << "\n" << "Last Name : " << player[i].getLastName() <<
            "\n" << "Age : " << player[i].getAge() << "\n" << "Current Team : " << player[i].getCurrentTeam() << 
            "\n" << "Position : " << player[i].getPosition() << "\n" << "Status :  " << player[i].getStatus()  << "\n\n";
    }

    cin.get() ;

    menu() ;
}

void inserttask()
{
    string task ;
    string priority ;

    for (int i = 0; i < 6; i++)
    {
        cout << "\nEnter name of task to be performed : " ;
        cin >> task ;

        cout << "\nEnter priority rating : " ;
        cout << "\nHigh or Low" ;
        cin >> priority ;
            if (priority == "High" | priority == "high")
            {
                inserttop(task) ;
            }
            else if(priority =="Low" | priority =="low")
            {
                insertbottom(task) ;
            }
    }

    for (int j = 0; j < 6; j++)
    {
        cout << list[j] ;
    }

    cin.get() ;

    menu() ;
}

void menu()
{
    cout << "\n\n MENU" << "\n" ;
    cout << "\n A. Store Player Information" ;
    cout << "\n B. Show Player Informaton" ;
    cout << "\n C. Delete Player Information" ;
    cout << "\n D. Display All Players Sorted By Age";
    cout << "\n E. Insert tasks by priority" ;
    cout << "\n Z. Exit \n\n" ;

    string x =  "";
    cin >> x ;

    if (x=="a" | x=="A")
    { 
        storeinfo() ;
    }
    else if (x=="b" | x=="B")
    {
        showinfo() ;
    }
    else if (x=="c" | x=="C")
    {
        deleteinfo() ;
    }
    else if (x=="d" | x=="D")
    {
        displayallinfo() ;
    }
    else if (x=="e" | x=="E")
    {
        inserttask() ;
    }
    else if (x=="z" | x=="Z")
    {
        exit(0) ;
    }
    else
    {
        cout << "Invalid Choice" ;
        menu() ;
    }
}

int linsearch(string val)
{
    for (int j=0; j <= 3; j++)
    {
        if  (player[j].getLastName()==val)
         return j ;         
    }
        return -1 ;
}

void inserttop(string task)
{
    int head = 0 ;
    string temp ;

    for (int i = 0; i < listlength; i++)
    {
        list[head + 1] = list[head] ;
        temp = task ;
        list[head] = temp ;
        temp = "" ;
    }
}

void insertbottom(string task)
{
    int tail = listlength ;
    string temp ;

    for (int i = 0; i < listlength; i++)
    {
        list[tail - 1] = list[tail] ;
        temp = task ;
        list[tail] = temp ;
        temp = "" ;
    }
}

Answer 1

该算法存在一些问题。我将把这个功能作为一个起点：

void inserttop(string task)
{
    int head = 0 ;
    string temp ;

    for (int i = 0; i < listlength; i++)
    {
        list[head + 1] = list[head] ;
        temp = task ;
        list[head] = temp ;
        temp = "" ;
    }
}

首先要注意的是，您循环使用i的不同值，但在您的周期中根本不使用i。其次，你似乎添加元素，但从不修改列表的长度（不知道如何声明这些变量，所以我可能在这里做出错误的假设）。第三，变量temp在这里没用（特别是，你不需要在每个循环结束时将它重置为空字符串）。

你可能意味着更类似的东西：

void inserttop(string task)
{
    // Expand the list by one... [bounds check should be done, omitted here]
    listlength++;

    // Overwrite each element with the previous one, making room
    // for the new element in the first position of the array.
    // Take care of proceeding backwards (see the indexes used
    // inside the cycle) to avoid overwriting the first value
    // all over the list.
    for (int i = 1; i <= listlength; i++)
    {
        list[listlength - i] = list[listlength - i - 1] ;
    }

    // Now you can set the first element...
    list[0] = task;
}

我相信insertbottom会遇到同样的问题，所以你可能不得不做一些对称的事情：

// Again, don't forget to do bounds checking... this piece of code is just a hint
void insertbottom(string task)
{
    for (int i = 0; i < listlength - 1; i++)
    {
        list[i] = list[i + 1] ;
    }

    list[listlength] = task;

    listlength++;
}