堆棧損壞，不會返回

Question

我創建了自己的堆棧和重載函數。然而，當我調用函數返回堆棧被損壞，我不明白爲什麼：/我是新來的C + +，並希望學習！這裏是我的代碼

主要

int main(){ 
string line; 
SStack s1(1000); 
SStack s2(1000); 
int cap = s1.getCapacity(); 
cout << "Is the stack empty? " << s1.IsEmpty() << "\n"; 
cout << "The capacity of the stack is: " << cap << "\n"; 
ifstream myfile("all.last.txt"); 
cout << "s1 begin pushing: \n"; 
for (int i = 0; i <= 500; i++){ 
    getline(myfile, line); 
    cout << "Pushing " << line << "\n"; 
    s1.push(line); 
} 
cout << "s2 begin pushing: \n"; 
for (int i = 0; i <= 50; i++){ 
    getline(myfile, line); 
    cout << "Pushing " << line << "\n"; 
    s2.push(line); 
} 
myfile.close(); 
cout << "Is the stack empty? " << s1.IsEmpty() << "\n"; 
string top = s1.top(); 
cout << "The top object on the stack is: " << top << "\n"; 
cout << "The size of the stack is: " << s1.size() << "\n"; 
cout << "Popping: " << s1.pop() << "\n"; 
cout << "Size after pop is: " << s1.size() << "\n"; 
s1 = s1 + s2; 
cout << s1.top(); 

}

SStack功能，這並不返回

SStack::SStack(const SStack& s) : used(-1), Capacity(0), DynamicStack(0){ 
    *this = s; 
} 

SStack SStack::operator=(const SStack& s){ 
    if (this != &s){ 
     int cap = s.getCapacity(); 
     DynamicStack = new string[cap]; 
     Capacity = cap; 
     used = -1; 
     for (int count = 0; count < s.size(); count++){ 
      DynamicStack[count] = s.DynamicStack[count]; 
      used++; 
     } 
     } 
     return *this; 
} 

SStack SStack::operator +(const SStack& s2){ 
int size1 = used + 1; 
int size2 = s2.size(); 
SStack result = *this; 
if (size1 + size2 <= Capacity){ 
    for (int count = 0; count < s2.size(); count++){ 
     result.push(s2.DynamicStack[count]); 
    } 
    return result; 
} 
else{ 
    cout << "Error stack is not big enough"; 
    return result; 
} 

Answer 1

您在2個​​地方分配堆疊的情況下，但我還沒有看到運營商=定義。 我建議你添加一個operator =（）到你的SStack類並委託你的拷貝構造函數到這個運算符=（）。請確保您的運營商=（）檢查它是否將自身複製：

... 
SStack::SStack(const SStack &s) : used(-1), Capacity(0), DynamicStack(0) 
{ 
    *this = s; 
} 
SStack &SStack::operator=(const SStack &s) 
{ 
    if (this != &s && s.size() > 0) 
    { 
     // check if we already have an allocated array 
     if (Capacity < s.size()) 
     { 
      // safe even if Capacity==0 as long as DynamicStack==0 too 
      delete [] DynamicStack; 

      int cap = s.getCapacity(); 
      DynamicStack = new string[cap]; 
      Capacity = cap; 
     } 
     used = -1; 
     for (int count = 0; count < s.size(); count++){ 
      DynamicStack[count] = s.DynamicStack[count]; 
      used++; 
     } 
    } 
    return *this; 
} 

與degugger試試這個，我建議你重新檢查你「拿來主義」的變量，以確保它實際上有你在所有地方想索引呢用來。

希望這會有所幫助。