class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
int n = grid.size(), m = grid0.size();
vector<int> dp(m + 1, 0);
int res = INT_MAX;
dp0 = grid00;
// for (int i = 1; i < n; ++i) {
// dpi0 = gridi0 + dpi - 10;
// }
for (int i = 1; i < m; ++i) {
dpi = grid0i + dpi - 1;
}
for (int i = 1; i < n; ++i) {
dp0 =dp0+ gridi0;
for (int j = 1; j < m; ++j) {
dpj = min(dpj, dpj - 1) + gridij;
}
}
return dpm - 1;
}
};