Skip to content
TheChatArchiveThe Chat Archive
gpt-3.5-turbo-0613· OpenAIAi2 WildChat-4.8M (AI2)

finish the codes of the tasks only and the order of the rank should be in desending…

  1. User

    finish the codes of the tasks only and the order of the rank should be in desending order of marks: #include #include #include

    using namespace std;

    const int MAX_PLAYER_NAME = 10;

    class LinkNode { private: float score; char *name; LinkNode *prev; // point to previous node LinkNode *next; // point to next node

    public: char *getName() { return name; } float getScore() { return score; } LinkNode *getPrev() { return prev; }; LinkNode *getNext() { return next; }; void setPrev(LinkNode *prev) { this->prev = prev; } void setNext(LinkNode *next) { this->next = next; } void show() { cout << left << setw(10) << name << left << setw(10) << score; }

    // Task 1: Complete the Constructor and Destructor function
    // tips: allocate and release variable with dynamic memory
    // Constructor
    LinkNode(char *name, float score)
    {
        
    }
    // Destructor
    ~LinkNode()
    {
        
    }
    

    };

    class DoubledLink { private: LinkNode *head; // point to the head node LinkNode *tail; // point to the tail node

    private: // Task 2: Complete the insert function: insert Node a in the front of Node b // tips: check the boundary condition, e.g. Node a/b/tail is nullptr void insert(LinkNode *newNode, LinkNode *existNode) {

    }
    
    // Task 3: Complete the remove function: remove Node in DoubledLink, if Node is nullptr, return void
    // tips: check the boundary condition, e.g. Node is nullptr/head/tail
    void remove(LinkNode *node)
    {
        
    }
    

    /* YOU MUST NOT MODIFY PUBLIC FUNCTIONS BELOW, EXCEPT CONSTRUCTOR & DECONSTRUCTOR */ public: LinkNode *queryName(char *targetname) { LinkNode *curNode = head; while (curNode != nullptr) { if (strcmp(curNode->getName(), targetname) == 0) { return curNode; } curNode = curNode->getNext(); } return nullptr; } LinkNode *queryBelowScore(float targetScore) { LinkNode *curNode = head; while (curNode != nullptr) { if (curNode->getScore() < targetScore) { return curNode; } curNode = curNode->getNext(); } return nullptr; } void addPlayer(char *name, float score) { LinkNode *queryPlayer = this->queryName(name); if (queryPlayer != nullptr) this->remove(queryPlayer); // find existed player

        LinkNode *newPlayer = new LinkNode(name, score); // set Node in LinkNode
        LinkNode *insertPlayer = this->queryBelowScore(score);
        this->insert(newPlayer, insertPlayer);
    }
    void show()
    {
        LinkNode *curNode = head;
        int rank = 1;
        cout << "================ Game Leaderboard ==============" << endl;
        cout << "Rank  Name  Score" << endl;
        while (curNode != nullptr)
        {
            cout << rank << " ";
            curNode->show();
            cout << " " << endl;
            curNode = curNode->getNext();
            rank++;
        }
    }
    

    /* YOU MUST NOT MODIFY FUNCTIONS ABOVE, EXCEPT CONSTRUCTOR & DECONSTRUCTOR */

    public: // Task 4: Complete the Constructor and Destructor function // Constructor DoubledLink() {

    }
    // Destructor
    ~DoubledLink()
    {
        
    }
    

    };

    /* YOU MUST NOT MODIFY THE MAIN FUNCTION BELOW */ int main() { DoubledLink *gameLeaderboard = new DoubledLink(); cout << "This is a real-time updated game leaderboard, players ranked in descending order by score." << endl; cout << "Some new players join, some players update score." << endl; cout << "Game Ranking will show after each operation." << endl; cout << "Game over when input 0 0." << endl;

    while (true)
    {
        char name[MAX_PLAYER_NAME]; // Declare the Player's name
        float score;                // Declare the Player's score
        cin >> name >> score;
        if (strcmp(name, "0") == 0 && score == 0)
        {
            cout << "Game Over." << endl;
            break;
        }
        // update game leaderboard
        gameLeaderboard->addPlayer(name, score);
        gameLeaderboard->show();
    }
    
    delete gameLeaderboard;
    return 0;
    

    }

  2. Assistant

    #include #include #include

    using namespace std;

    const int MAX_PLAYER_NAME = 10;

    class LinkNode { private: float score; char *name; LinkNode *prev; // point to previous node LinkNode *next; // point to next node

    public: char *getName() { return name; } float getScore() { return score; } LinkNode *getPrev() { return prev; }; LinkNode *getNext() { return next; }; void setPrev(LinkNode *prev) { this->prev = prev; } void setNext(LinkNode *next) { this->next = next; } void show() { cout << left << setw(10) << name << left << setw(10) << score; }

    // Task 1: Complete the Constructor and Destructor function
    // tips: allocate and release variable with dynamic memory
    // Constructor
    LinkNode(char *name, float score)
    {
        this->name = new char[strlen(name) + 1];
        strcpy(this->name, name);
        this->score = score;
        this->prev = nullptr;
        this->next = nullptr;
    }
    // Destructor
    ~LinkNode()
    {
        delete [] name;
    }
    

    };

    class DoubledLink { private: LinkNode *head; // point to the head node LinkNode *tail; // point to the tail node

    private: // Task 2: Complete the insert function: insert Node a in the front of Node b // tips: check the boundary condition, e.g. Node a/b/tail is nullptr void insert(LinkNode *newNode, LinkNode *existNode) { if (newNode == nullptr || existNode == nullptr) { return; }

        if (existNode == head)
        {
            newNode->setNext(head);
            head->setPrev(newNode);
            head = newNode;
        }
        else
        {
            newNode->setNext(existNode);
            newNode->setPrev(existNode->getPrev());
            existNode->getPrev()->setNext(newNode);
            existNode->setPrev(newNode);
        }
    }
    
    // Task 3: Complete the remove function: remove Node in DoubledLink, if Node is nullptr, return void
    // tips: check the boundary condition, e.g. Node is nullptr/head/tail
    void remove(LinkNode *node)
    {
        if (node == nullptr)
        {
            return;
        }
        
        if (node == head)
        {
            head = node->getNext();
            if (head != nullptr)
            {
                head->setPrev(nullptr);
            }
        }
        else if (node == tail)
        {
            tail = node->getPrev();
            if (tail != nullptr)
            {
                tail->setNext(nullptr);
            }
        }
        else
        {
            node->getPrev()->setNext(node->getNext());
            node->getNext()->setPrev(node->getPrev());
        }
    
        delete node;
    }
    

    /* YOU MUST NOT MODIFY PUBLIC FUNCTIONS BELOW, EXCEPT CONSTRUCTOR & DECONSTRUCTOR */ public: LinkNode *queryName(char *targetname) { LinkNode *curNode = head; while (curNode != nullptr) { if (strcmp(curNode->getName(), targetname) == 0) { return curNode; } curNode = curNode->getNext(); } return nullptr; } LinkNode *queryBelowScore(float targetScore) { LinkNode *curNode = head; while (curNode != nullptr) { if (curNode->getScore() < targetScore) { return curNode; } curNode = curNode->getNext(); } return nullptr; } void addPlayer(char *name, float score) { LinkNode *queryPlayer = this->queryName(name); if (queryPlayer != nullptr) this->remove(queryPlayer); // find existed player

        LinkNode *newPlayer = new LinkNode(name, score); // set Node in LinkNode
        LinkNode *insertPlayer = this->queryBelowScore(score);
        this->insert(newPlayer, insertPlayer);
    }
    void show()
    {
        LinkNode *curNode = head;
        int rank = 1;
        cout << "================ Game Leaderboard ==============" << endl;
        cout << "Rank  Name  Score" << endl;
        while (curNode != nullptr)
        {
            cout << rank << " ";
            curNode->show();
            cout << " " << endl;
            curNode = curNode->getNext();
            rank++;
        }
    }
    

    /* YOU MUST NOT MODIFY FUNCTIONS ABOVE, EXCEPT CONSTRUCTOR & DECONSTRUCTOR */

    public: // Task 4: Complete the Constructor and Destructor function // Constructor DoubledLink() { head = nullptr; tail = nullptr; } // Destructor ~DoubledLink() { LinkNode *curNode = head; while (curNode != nullptr) { LinkNode *nextNode = curNode->getNext(); delete curNode; curNode = nextNode; } } };

    /* YOU MUST NOT MODIFY THE MAIN FUNCTION BELOW */ int main() { DoubledLink *gameLeaderboard = new DoubledLink(); cout << "This is a real-time updated game leaderboard, players ranked in descending order by score." << endl; cout << "Some new players join, some players update score." << endl; cout << "Game Ranking will show after each operation." << endl; cout << "Game over when input 0 0." << endl;

    while (true)
    {
        char name[MAX_PLAYER_NAME]; // Declare the Player's name
        float score;                // Declare the Player's score
        cin >> name >> score;
        if (strcmp(name, "0") == 0 && score == 0)
        {
            cout << "Game Over." << endl;
            break;
        }
        // update game leaderboard
        gameLeaderboard->addPlayer(name, score);
        gameLeaderboard->show();
    }
    
    delete gameLeaderboard;
    return 0;
    

    }