Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.
题目解析: 到达当前位置(i, j)只有两条路经要么是从左边(i, j- 1)过来,要么从(i - 1, j)上面过来,选择其中距离最短的即可
int minPathSum(int** grid, int gridRowSize, int gridColSize) {
for (int i = 0; i < gridRowSize; ++i)
{
for (int j = 0; j < gridColSize; ++j)
{
if (i == 0 && j == 0) continue;
else if (i == 0 && j > 0) {
grid[i][j] += grid[i][j - 1];
}
else if (i > 0 && j == 0) {
grid[i][j] += grid[i - 1][j];
}
else {
if (grid[i - 1][j] > grid[i][j - 1]) grid[i][j] += grid[i][j - 1];
else grid[i][j] += grid[i - 1][j];
}
}
}
return grid[gridRowSize - 1][gridColSize - 1];
}