LeetCode 64 Minimum Path Sum

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.

一种机智的DP解法：

int minPathSum(vector<vector<int>>& A) {
auto m = A.size(), n = A[0].size();
for (int i = 1; i < m; ++i) A[i][0] += A[i - 1][0];
for (int j = 1; j < n; ++j) A[0][j] += A[0][j - 1];
for (int i = 1; i < m; ++i)
for (int j = 1; j < n; ++j)
A[i][j] += min(A[i - 1][j], A[i][j - 1]);
return A[m - 1][n - 1];
}