leetcode

0 class Solution {

1 public:

2 int minPathCost(vector<vector<int>> &grid, const vector<vector<int>> &moveCost) {

3 const int n = grid.size(), m = grid[0].size();

4

5 for (int i = n - 2; i >= 0; i--) {

6 for (int j = 0; j < m; j++) {

7 int res = INT_MAX;

8 for (int k = 0; k < m; k++) {

9 res = min(res, grid[i + 1][k] + moveCost[grid[i][j]][k]);

10 }

11 grid[i][j] += res;

12 }

13 }

14

15 return *min_element(begin(grid[0]), end(grid[0]));

16 }

17 };