使用C ++中的鏈接列表按字母順序對字符串進行排序

Question

我正在分配鏈接的字符串列表。 一切正常，直到我進入排序部分。 我也在使用類。 我已經有2個功能。 第一個minimum(string) ，它返回按字母順序排在最前面的字符串。

此功能工作正常。 我還有一個函數remove(string) ，它從鏈表中刪除包含給定字符串的節點。 如果成功，則返回true，否則返回false（如果字符串不在列表中），在這種情況下，我必須擦除minimum(string)函數返回的minimum(string) 。 我遇到的功能是sort() 。

它希望我將StringNode指針定義為新列表（空列表）的頭，然后需要一個循環，在該循環中我將調用minimum(string)和remove(string)函數。 在循環內部，我還需要將此節點插入新列表中的適當位置（將其追加到末尾）。 舊的頭指針（現在為空）必須指向新列表。

我對此很困惑，到目前為止，我有：

void StringList::sort()
{
    StringNode *newList = new StringNode;
    newList = NULL;

    string mini;
    bool removed;

    while (newList->next != NULL)
    {
        StringNode *newList2 = new StringNode;
        StringNode *p = head;
        mini = minimum();
        p->data = mini;
        p->next = NULL;
        newList2 = newList2->next;
        newList2->next = p;
        removed = remove(mini);
        newList = newList2;
    }
}

我的理解是：我需要創建一個新節點，該節點將是一個空列表，意味着newList->next = NULL; 然后在循環上，我需要創建另一個新節點，以及一個指向循環內新節點頭的指針。 我需要將最小值給出的值存儲在指針p ，並使指針指向新節點。

任何幫助將不勝感激。 謝謝！

這是孔程序。

// StringList.cpp

#include <iomanip>
#include <iostream>
#include <sstream>
#include "StringList.h"

using namespace std;

//******************************************************************************
// StringList: creates an empty list
//******************************************************************************

StringList::StringList()
{
    head = NULL;
}

//******************************************************************************
// StringList: deallocates all the nodes in StringList
//******************************************************************************

StringList::~StringList()
{
    StringNode *p;
    StringNode *n;

    p = head;

    while (p != NULL)
    {
        n = p->next;
        delete p;
        p = n;
    }

}

//******************************************************************************
// count: returns the total number of nodes in the list.
//******************************************************************************

int StringList::count()
{
    int count = 0;
    StringNode *p;
    p = head;
    while ( p != NULL )
    {
       count++;
       p = p->next;
    }
    return count;
}

//******************************************************************************
// add: adds a new node to the beginning of the list.
//******************************************************************************

void StringList::add(string movie)
{
    StringNode *newNode = new StringNode;
    newNode->data = movie;
    newNode->next = head;
    head = newNode;
}

//******************************************************************************
// remove: removes a node containing the string from linked list
// returns true if successful or false the string is not in the list
//******************************************************************************

bool StringList::remove(string movie)
{
    StringNode *p = head;
    StringNode *n = NULL;

    while (p != NULL && p->data != movie )
    {
        n = p;
        p = p->next;

      if (p == NULL )
      {
         return false;
      }
      else if (p->data == movie)
      {
         n->next = p->next;
         delete p;
         return true;
      }
    }
}

//******************************************************************************
//display: Displays the strings in the list.
//******************************************************************************

void StringList::display()
{
    StringNode *p;
    p = head;

    while (p != NULL)
    {
        cout << p->data << " ";
        p = p->next;
    }
    cout << endl;
}

//******************************************************************************
//minimum: return the string in alphabetical order
//******************************************************************************

string StringList::minimum()
{
    StringNode *p = head;

    string minimum = p->data;

    while (p->next != NULL)
    {
        p = p->next;
        if(minimum > p->data)
        {
             minimum = p->data;
        }
    }
    return minimum;

}

//******************************************************************************
//sort: will call the minimum function and remove function
//******************************************************************************

 void StringList::sort()
{
StringNode* newhead;  // create a new head pointer
string mini;
bool removed; 

//adding the first node to the new list.
StringNode *newnode = new StringNode;
mini = minimum();  // get the minimum from the existing linked list
newnode->data = mini; 
newnode->next = NULL;
newhead=newnode; //add the minimum node to the new list(with the newhead)
StringNode *p = newhead;

while (head != NULL) // loop should run until there's no node left in the original list
{
    StringNode *newnode = new StringNode;
    mini = minimum();  // get the minimum from the existing linked list
    newnode->data = mini; 
    newnode->next = NULL;
    p->next=newnode; //add the minimum node to the new list(with the newhead pointer)
    removed = remove(mini);
    p=p->next;  
}
 head=newhead; //finally change the head pointer, so that the head now points to sorted list.
}

// StringList.h

#ifndef STRINGLIST_H_INCLUDED
#define STRINGLIST_H_INCLUDED

#include <string>
using namespace std;

class StringList
{
  private:
    struct StringNode          // the Nodes of the linked list
    {
        string data;           // data is a string
        StringNode *next;      // points to next node in list
    };

    StringNode *head;           // the head pointer

  public:
    StringList();
    ~StringList();

    int count();
    void add(string);
    bool remove(string);
    void display();
    string minimum();
    void sort();
};



#endif // STRINGLIST_H_INCLUDED

//Driver.cpp

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

#include "StringList.h"

int main()
{
    //testing StringList
    StringList slist;

    string movie1 = "Star Wars";
    string movie2 = "Fargo";
    string movie3 = "Back to the Future";
    string movie4 = "Titanic";

    // Testing add/display/count
    cout << "Testing add/display/count: " << endl;
    cout << "count is: " << slist.count() << endl;

    slist.add(movie1);
    slist.display();
    cout << "count is: " << slist.count() << endl;

    slist.add(movie2);
    slist.display();
    cout << "count is: " << slist.count() << endl;

    slist.add(movie3);
    slist.add(movie4);
    slist.display();
    cout << "count is: " << slist.count() << endl;

    // Testing remove
    cout << endl;
    cout << "Testing remove: " << endl;
    bool delResult;
    delResult = slist.remove(movie4);
    cout << "remove result movie4 = " << boolalpha << delResult << endl;

    delResult = slist.remove(movie3);
    cout << "remove result movie3 = " << boolalpha << delResult << endl;

    delResult = slist.remove("Not There");
    cout << "remove result Not There = " << boolalpha << delResult << endl;

   cout << "display after remove: " << endl;
   slist.display();
   cout << "count is: " << slist.count() << endl;

   //Testing minimum
    cout << endl;
    cout << "Testing minimum: " << endl;

    cout << "Test minimum 1: " << endl;
    slist.display();
    cout << "minimum: " << boolalpha << slist.minimum() << endl;

    cout << "Test minimum 2: " << endl;
    slist.add(movie4);
    slist.display();
    cout << "minimum: " << boolalpha << slist.minimum() << endl;

    cout << "Test minimum 3: " << endl;
    slist.add(movie3);
    slist.display();
    cout << "minimum: " << boolalpha << slist.minimum() << endl;

    //Testing sort and display

    cout << endl;
    cout << "Testing sort/display: " << endl;
    slist.sort();
    slist.display();

    cout << endl;
    cout << "Testing sort/display after add: " << endl;
    slist.add("Jurassic Park");
    slist.display();
    cout << "now sorted: " << endl;
    slist.sort();
    slist.display();


}

Answer 1

您的刪除功能有小毛病。 您沒有考慮刪除第一個節點的可能性。

bool StringList::remove(string movie)
{
StringNode *p = head;
StringNode *n = NULL;
if(p->data==movie)  //added this condition
{
    head=head->next;
    delete p;
    return true;
}
while (p != NULL && p->data != movie )
{
    n = p;
    p = p->next;

  if (p == NULL )
  {
     return false;
  }
  else if (p->data == movie)
  {
     n->next = p->next;
     delete p;
     return true;
  }
}
}

最終排序功能。 目的是通過使用minimum和remove函數對現有列表進行排序，並獲得新的排序列表。 您需要從現有列表中獲取最小值，然后繼續將其添加到新列表的末尾。 最后更改頭部指針，使其指向新列表。

while循環應運行到現有列表變為空為止。

void StringList::sort()
{  
   string mini;
   bool removed;

  //adding the first node to the new list.
  StringNode *newnode1 = new StringNode;
  mini = minimum();  // get the minimum from the existing linked list
  newnode1->data = mini;
  newnode1->next = NULL;
  removed =remove(mini);
  StringNode *p = newnode1;

while (head != NULL) // the loop should run until the original list is empty
{
  StringNode *newnode = new StringNode;
  mini = minimum();  // get the minimum from the existing linked list
  newnode->data = mini;
  newnode->next = NULL;
  p->next=newnode; //add the minimum node to the new list
  removed = remove(mini);
  p=p->next;
}
   head=newnode1; //finally change the head pointer, so that the head now points to sorted list.
}