刪除雙向鏈表中的節點

Question

我試圖從帶有從文件中讀入的數據的雙向鏈表中刪除一個節點，並將其重寫到具有未刪除節點的文件中。 但我這樣做是錯誤的。

它要么只刪除節點的一​​部分，要么不刪除任何東西（起始節點）。

這是我的標題

hw07.h

#ifndef HW07_H_
#define HW07_H_

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

typedef struct slist  slist;

struct stud
{
    string term;
    string title;
    string description;
    string tktNum;
    string location;
    string lecDay;
    string instructor;
    string labLoc;
    string labDay;
    string labInstruct;
    string units;
    string preReqs;
    string grade;
};
struct sentry
{
    slist *list;
    sentry *next;
    sentry *prev;
    stud *data;
};
struct slist
{
    int length;
    sentry *first;
    sentry *last;
};

void readFile(slist *&header);
void deleteDataTN(slist *&header);

#endif

我的主要

hw07.cpp

#include "hw07.h"

int main()
{
    slist *header = NULL;

    readFile(header);
    deleteDataTN(header);
    return 0;
 }

我的 readFile 函數

讀取文件

#include "hw07.h"

void readFile(slist *&header)
{
    ifstream fin;
    sentry *node, *temp;

    fin.open("sbclassdb.txt");
    while(!fin.eof())
    {
        if(header == NULL)
        {
            header = new slist;
            header-> length = 0;
            header-> first = NULL;
            header-> last  = NULL;

            node = new sentry;
            header-> first = node;
            header-> last  = node;
            node-> prev = NULL;
            node-> next = NULL;
        }else
        {
            node = new sentry;
            node-> prev = header-> last;
            node-> next = NULL;
            temp = header -> last;
            temp-> next = node;
            header-> last = node;
        }
    node->data = new stud;
    getline(fin, node->data->term);
    getline(fin, node->data->title);
    getline(fin, node->data->description);
    getline(fin, node->data->tktNum);
    getline(fin, node->data->location);
    getline(fin, node->data->lecDay);
    getline(fin, node->data->instructor);
    getline(fin, node->data->labLoc);
    getline(fin, node->data->labDay);
    getline(fin, node->data->labInstruct);
    getline(fin, node->data->units);
    getline(fin, node->data->preReqs);
    getline(fin, node->data->grade);
    header->length++;

    string blankLine;
    if(!getline(fin, blankLine))
    break;
    }
    fin.close();
}

我的 deleteData 函數

刪除數據TN.cpp

#include "hw07.h"

void deleteDataTN(slist *&header)
{
    sentry *node, *temp;
    string ticketNum;
    ofstream fout;
    int index;
    bool found;
    found = false;
    index = 0;

    cout << "Ticket Number: ";
    getline(cin, ticketNum);

    node = header->first;
    while(index < header->length && !found)
    {
        if(node->data->tktNum == ticketNum)
        {
            found = true;
            free(node->data);
        }
        else
        {
             ++index;
             temp = node;
             node = temp->next;
         }
        fout.open("sbclassdb.txt");

    node = header->first;
    for(int i=0; i<header->length; ++i)
    {
        fout << node->data->term << endl;
        fout << node->data->title << endl;
        fout << node->data->description << endl;
        fout << node->data->tktNum << endl;
        fout << node->data->location << endl;
        fout << node->data->lecDay << endl;
        fout << node->data->instructor << endl;
        fout << node->data->labLoc << endl;
        fout << node->data->labDay << endl;
        fout << node->data->labInstruct << endl;
        fout << node->data->units << endl;
        fout << node->data->preReqs << endl;
        fout << node->data->grade << endl;

        temp = node;
        node = temp->next;
        fout << "\n";
    }
}

我的文本文件用於讀入文件

sbclassdb.txt

Fall 2017
CS1A
Intro to Computer Science 1
11111
SM101
TTH 100PM
John Doe
SM102
TTH 300PM
John Doe
5
NA
A

Spring 2018
CS1B
Intro to Computer Science 2
22222
SM101
TTH 200PM
Jane Doe
SM102
TTH 300PM
Jane Doe
5
CS1A
NA

Spring 2018
CS4A
Into to Java for Computer Science
12345
BGS101
MWF 200PM
Bob Smith
BGS102
Bob Smith
4
CS1B
NA

Answer 1

new應該用delete清理（​​不是free用於malloc ）

struct sentry{stud *data;...}可以更改為struct sentry{stud data;...} 。 並且不需要sentry::list成員：

struct sentry
{
    sentry *next;
    sentry *prev;
    stud data;
};

將sentry::data聲明為指針沒有任何好處。 如果您只是將數據聲明為stud data; 那么您不必使用new / delete分配/釋放。 （您仍然需要為節點new / delete ）

void deleteDataTN(slist *&header)可以聲明為void deleteDataTN(slist &header) ，您只需調用deleteDataTN(myheader);

不要使用while(!fin.eof()){...} 。 關於這個問題有很多 SO 主題。 參見例如how-does-ifstreams-eof-work 。 我之前寫了一個我認為是錯誤的代碼，這是更正后的版本：

while(fin.good())
{
    sentry *node = new sentry;
    if(header.first == nullptr)
    {
        node->prev = nullptr;
        node->next = nullptr;
        header.first = node;
        header.last = node;
    }
    else
    {
        header.last->next = node;
        node->prev = header.last;
        node->next = nullptr;
        header.last = node;
    }
    ...
}

要刪除節點，您可以向slist添加一個函數：

struct slist
{
    ...
    void remove(sentry *node);
};

void slist::remove(sentry *node)
{
    if(!node) return;
    if(!first) return;//empty list, do nothing
    if(first->next == nullptr)//deleting the only node
    {
        first = last = nullptr;
    }
    else if(node == last)//deleting the last node
    {
        last = node->prev;
        node->prev->next = nullptr;
    }
    else if(node == first)//deleting the first node
    {
        first = node->next;
        first->prev = nullptr;
    }
    else//deleting a node in the mid
    {
        node->prev->next = node->next;
        node->next->prev = node->prev;
    }
    length--;
    delete node;
}

現在您可以刪除任何節點

node = header.first;
while(node)
{
    if(node->data.tktNum == "xyz")
    {
        header.remove(node);
        break;
    }
    node = node->next;
}