leetcode

0 class Solution {

1 public:

2 int calculateMinimumHP(const vector<vector<int>> &dungeon) const {

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

4 vector<int> dp(n + 1, INT_MAX);

5

6 dp[n - 1] = 1;

7 for (int j = m - 1; j >= 0; j--) {

8 for (int i = n - 1; i >= 0; i--) {

9 const int need = min(dp[i], dp[i + 1]) - dungeon[i][j];

10 dp[i] = max(need, 1);

11 }

12 }

13

14 return dp[0];

15 }

16 };