C++求矩阵最小路径和进阶方法空间复杂度O(min {row, col})

#include <iostream>


int minPathSum_pro(const int(*pArr) [10], const int &row, const int &col);


int main()
{
int row = 0, col = 0, num = 0;
int arr[10][10];
std::cin >> row >> col;


for (int i = 0; i < row; ++i)
{
for (int j = 0; j < col; ++j)
{
std::cin >> num;
arr[i][j] = num;
}
}


std::cout << minPathSum_pro(arr, row, col);




system("pause");
return 0;
}


int minPathSum_pro(const int(*pArr)[10], const int &row, const int &col)
{
int dim = row <= col ? row : col; //dimension 维度
int large = dim == row ? col : row; 
int *pArray = new int[dim];
int num = 0; //用于返回最终的最小路径值

pArray[0] = pArr[0][0];
int flag = -1;
flag = dim == row ? 0 : 1;    //flag = 0表示row <= col flag = 1 row > col


pArray[0] = pArr[0][0];

for (int i = 1; i < dim; ++i) //初始化第一维数组，用来进行之后的翻滚
{
pArray[i] = pArray[i - 1] + (flag == 0 ? pArr[0][i] : pArr[i][0]);
}
for (int i = 1; i < dim; ++i)
{
pArray[0] = pArray[0] + (flag == 0 ? pArr[i][0] : pArr[0][i]);
for (int j = 1; j < large; ++j)
{
pArray[j] = (pArray[j - 1] < pArray[j] ? pArray[j - 1] : pArray[j]) + (flag == 0 ? pArr[i][j] : pArr[j][i]);
}
}
num = pArray[dim - 1];
delete[] pArray;


return num;
}