刪除動態數組後，堆腐敗

Question

我知道這個問題被問了很多次，但我找不到解決方案，我的錯誤 我想做一個程序來檢查給定的矩陣是否是對稱的或用戶輸入測試用例的數量然後是大小然後矩陣和輸出是否是對稱的 該程序工作正常，直到我嘗試了一個大於3的大小它打破了這個錯誤，並且在調試時似乎它在delete []處破壞了ARRL

#include <iostream> 
#include <string> 
using namespace std; 
int n(char s) 
{ 
    switch (s) 
    { 
    case '0': 
     return 0; 
    case '1': 
     return 1; 
    case '2': 
     return 2; 
    case '3': 
     return 3; 
    case '4': 
     return 4; 
    case '5': 
     return 5; 
    case '6': 
     return 6; 
    case '7': 
     return 7; 
    case '8': 
     return 8; 
    case '9': 
     return 9; 
    } 
} 
int getnumber(string a) 
{ 
    string num = ""; 
    for (int i = 0; i < a.size(); i++) 
    { 
     if (isdigit(a[i])) 
      num += a[i]; 
    } 
    if (num.size() == 1) 
    { 
     return n(num[0]); 
    } 
    if (num.size() == 2) 
    { 
     return (n(num[0]) * 10) + (n(num[1])); 
    } 

    if (num.size() == 3) 
    { 
     return (n(num[0]) * 100) + (n(num[1]) * 10) + (n(num[2])); 
    } 
} 
bool matrix2(long int**p, int r) 
{ 

    int c = 0, u = 0, ss = 0; 
    for (int i = 0; i < r; i++) 
    { 
     for (int j = 0; j < r; j++) 
     { 
      if (p[i][j]<0) 
       return false; 
     } 
    } 
    long int*arrL = new long int[r]; 
    long int*arrR = new long int[r]; 
    for (int i = 0; i < r; i++) 
    { 
     for (int j = 0; j < i; j++) 
     { 
      arrL[c++] = p[i][j]; 
      ss++; 
     } 
    } 
    for (int i = 0; i < r; i++) 
    { 
     for (int j = i + 1; j < r; j++) 
     { 
      arrR[u++] = p[i][j]; 
     } 
    } 
    for (int i = 0; i < ss; i++) 
    { 
     int q = ss - i - 1; 
     long int a = arrR[i]; 
     long int b = arrL[q]; 
     if (!(a == b)) 
     { 
      delete[]arrL; 
      delete[]arrR; 
      return false; 
     } 
     } 


    delete[]arrL; 
    delete[]arrR; 
    return true; 
} 
int main() 
{ 
    int t; 
    cin >> t; 
    for (int num = 0; num < t;num++) 
    { 

     int yy = num + 1; 
     string dimension; 
     cin.ignore(); 
     getline(cin, dimension); 
     int r = getnumber(dimension); 
     long int**p = new long int*[r]; 
     for (int w = 0; w < r; w++){ 
      p[w] = new long int[r]; 
     } 
     for (int w = 0; w < r; w++) 
     { 
      for (int ww = 0; ww < r; ww++) 
      { 
       cin >> p[w][ww]; 
      } 
     } 
    bool result = matrix2(p, r); 
     if (result) 
     { 
      cout << "Test #" << yy << ": Symmetric." << endl; 
     } 
     else 
     { 
      cout << "Test #" << yy << ": Non-symmetric." << endl; 
     } 
     for (int i = 0; i < r; i++) 
     { 
      delete[]p[i]; 
     } 
     delete[] p; 
    } 

    return 0; 

} 

Answer 1

ARRL和arrR分配尺寸r的，但隨後 ARRL [C++] = p [i] [j]; 執行超過r次，所以c超過r，所以你損壞了你的堆。