我有一个奇怪的分段错误，std :: length_error，有时我的代码可以工作吗？

如何解决我有一个奇怪的分段错误，std :: length_error，有时我的代码可以工作吗？

我完成了一些代码，打印出一个单词出现了多少次。但是，当我完成并尝试在其他编译器上运行代码时，它不起作用。首先，这是我的代码在我的初始文件中工作的图片：

但是当我使用其他编译器（onlinegdb）时，出现此错误：

最让我困惑的是；当我尝试将文件复制到新的VS Code .cpp文件时，它不起作用。它运行代码，但什么都不打印。当我进入gdb时，我发现此错误：

如果有人知道细分错误/ std :: length_error发生在哪里，请告诉我，如果您有任何建议将非常有用！另外，知道为什么我在同一编译器（VS代码）上得到不同的结果也将很有帮助。这是我的代码：

#include <fstream>
#include <iostream>
#include <string>

using namespace std;

class WordOccurrence 
{
public:
    WordOccurrence(const string& word="",int num=1)
    {
        word_ = word;
        num_ = num;
    }
    bool matchWord(const string & compare)
    {
        if(word_ == compare)
            return true;
        else
            return false;
    }   
    void increment()             
    {
        num_++;
    }   
    string getWord() const      
    {
        return word_;
    }
    int getNum() const          
    {
        return num_;
    }
private:
    string word_;
    int num_;
};

class WordList
{
public:
    friend bool equal(const WordList&,const WordList&);
    WordList();                         
    WordList(const WordList &);         
    ~WordList();                            
    WordList operator= (const WordList &);  
    void addWordFile(WordList w);
    void addWord(const string &);
    void print();
private:
    WordOccurrence *wordArray_;         
    int size_;
};

WordList::WordList() 
{
    size_ = 0;
    wordArray_ = new WordOccurrence [size_];
}

WordList::WordList (const WordList &neww) 
{   
    size_ = neww.size_;
    wordArray_ = new WordOccurrence[size_];

    for (int i = 0; i <= (size_ - 1); i++) 
        wordArray_[i] = neww.wordArray_[i];
}

WordList::~WordList () 
{
    delete [] wordArray_;
}

WordList WordList::operator= (WordList const &overload) 
{
    WordList temp(overload);
    swap(wordArray_,temp.wordArray_);
    swap(size_,temp.size_);
    return *this;
}

void WordList::addWord(const string& word) 
{
    if(size_ == 0)
    {
        WordOccurrence *first_array = new WordOccurrence[1];
        first_array[0] = word;
        delete[] wordArray_;
        wordArray_ = first_array;
        delete[] first_array;
        size_++;
        return;
    }

//if the word is already in the array,we increase the count of it by 1
    for (int i = 0; i < size_; i++) 
    {
        if (wordArray_[i].matchWord(word)) 
        {
            wordArray_[i].increment();
            return;
        }
    }

//if it is not in the array already,we need to increase its size and then add the new word to the wordarray.
    WordOccurrence *new_array = new WordOccurrence[size_+1];
    for (int i = 0; i < size_; i++)
    {
        new_array[i] = wordArray_[i];
    }
    new_array[size_] = WordOccurrence(word); 
    delete[] wordArray_;
    size_++;
    wordArray_ = new_array;
    delete[] new_array;
}
void WordList::print() 
{
//to output to a file because when we get a lot of words it's kinda hard to see on just the terminal
    ofstream myfile ("output.txt");
    WordList sortedList(*this);
    
//Sorting from smallest to largest
    int smallest = wordArray_[0].getNum();

    for (int i = 1; i < size_; i++) 
    {
//stores the smallest value into smallest
        if(wordArray_[i].getNum() < smallest) 
            smallest = wordArray_[i].getNum();
    }
    int location = 0;
//stores values from start to finish in the new list starting at location sortedList[0]
    while(location < size_) 
    {
        for(int i = 0; i < size_; i++) 
        {
//runs through the new list until it finds a value that is apart of the smallest/rarest words
            if(wordArray_[i].getNum() == smallest) 
            {
                sortedList.wordArray_[location] = wordArray_[i];
                location++;
            }
        }
//increases the value of smallest allowing for numbers with greater found values to be sorted
        smallest++;
    }   
//prints out the sorted version of wordarray
    for(int i = 0; i < size_; i++) 
    {
        string word = sortedList.wordArray_[i].getWord();
        int count = sortedList.wordArray_[i].getNum();
        cout << "Word: " << word << "   Amount: " << count << endl;
        //for longer amounts of text,it was hard to see on a editor so I also have it out to a file.
        myfile << "Word: " << word << "   Amount: " << count << endl;
    }
}

int main()
{
    WordList w;
    w.addWord("one");
    w.addWord("one"); 
    w.addWord("two");
    w.addWord("three");
    w.addWord("four");
    w.addWord("four");
    w.addWord("four");
    w.addWord("four");
    w.addWord("five");
    w.addWord("five");
    w.addWord("five");

    cout << "Sorted list" << endl;
    w.print();
}

解决方法

这有问题

    WordOccurrence *first_array = new WordOccurrence[1];
    first_array[0] = word;
    delete[] wordArray_;
    wordArray_ = first_array;
    delete[] first_array;
    size_++;
    return;

您将first_array分配给wordArray_，然后将其删除。这使wordArray_成为无效的指针。只需删除delete[] first_array;。应当删除两次并仅添加一个新线索，以表明出现了问题。

稍后在同一功能中出现相同的错误

WordOccurrence *new_array = new WordOccurrence[size_+1];
for (int i = 0; i < size_; i++)
{
    new_array[i] = wordArray_[i];
}
new_array[size_] = WordOccurrence(word); 
delete[] wordArray_;
size_++;
wordArray_ = new_array;
delete[] new_array;

delete[] new_array;不应该在那里。