While循环中的C++分段故障

C++ Segmentation Fault at While Loop

本文关键字:分段 故障 C++ 循环 While      更新时间:2023-10-16

由于某种原因,我在代码中的while循环中出现了分段错误,以回溯2d矩阵。我尝试添加了许多条件,以确保矩阵永远不会访问未识别的值。这是代码,任何帮助都将不胜感激!

  i = sizeA;
  j = sizeB;
  std::string op[sizeA];
  std::string mat = "match ";
  std::string del = "delete ";
  std::string ins = "insert ";
  std::string sub = "substitute ";
  int k = sizeA;
  bool stop = false;
  while (!stop)
  {
    if ((i == 0) && (j != 0))
    {
      op[k] = (ins + B[j]);
      j = (j - 1);
    }
    else if ((j == 0) && (i != 0))
    {
      op[k] = (del + A[i]);
      i = (i - 1);
    }
    else
    {
      if (smallest(costMatrix[i-1][j], costMatrix[i][j-1], costMatrix[i-1][j-1]) == costMatrix[i-1][j])  //deletion
      {
        op[k] = (del + A[i]);
        i = (i - 1);
      }
      else if (smallest(costMatrix[i-1][j], costMatrix[i][j-1], costMatrix[i-1][j-1]) == costMatrix[i][j-1])  //insertion
      {
        op[k] = (ins + B[j]);
        j = (j - 1);
      }
      else  //substitution or match
      {
        if (costMatrix[i-1][j-1] == costMatrix[i][j])  //match
        {
          op[k] = (mat + A[i]);
        }
        else  //substitution
        {
          op[k] = (sub + B[j]);
        }
        i = (i - 1);
        j = (j - 1);
      }
    }
    if ((i == 0) && (j == 0))
      stop = true;
    k = (k - 1);
  }

当您在循环的第一次迭代中分配op[k]时,您有k==sizeA,但opsizeA的数组,因此这种访问会导致未定义的行为,很可能会导致分段错误。