Skip to main content

Dynamic Programming - Medium Level - Question 2

Dynamic Programming - Medium Level - Question 2


Leetcode 174 Dungeon Game

The demons had captured the princess and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of m x n rooms laid out in a 2D grid. Our valiant knight was initially positioned in the top-left room and must fight his way through dungeon to rescue the princess.

The knight has an initial health point represented by a positive integer. If at any point his health point drops to 0 or below, he dies immediately.

Some of the rooms are guarded by demons (represented by negative integers), so the knight loses health upon entering these rooms; other rooms are either empty (represented as 0) or contain magic orbs that increase the knight's health (represented by positive integers).

To reach the princess as quickly as possible, the knight decides to move only rightward or downward in each step.

Return the knight's minimum initial health so that he can rescue the princess.

Note that any room can contain threats or power-ups, even the first room the knight enters and the bottom-right room where the princess is imprisoned.

Constraints:

m == dungeon.length

n == dungeon[i].length

1 <= m, n <= 200

-1000 <= dungeon[i][j] <= 1000


Analysis:

If we start from the left top corner to think about this question, it seems not easy... In this kind of situation, what about starting from the last step?

At the last step, without knowing all the previous data, we can calculated the minimum health point when the knight reaches this position.

If the dungeon[m-1][n-1] >= 0, then the minimum value is 1; if negative, it should be 1 - dungeon[m-1][n-1].

This can be the starting point for this question.

If we define f(i, j) is the minimum health point when reaching at location (i, j), then f(i, j) can be derived from f(i+1, j) and f(i, j+1).

int val = min(f(i+1, j), f(i, j+1)) - dungeon[i][j]

If val is positive, (for example when dungeon[i][j] is negative, or smaller than min(f(i+1, j), f(i, j+1)), then f(i, j) should be at least be val; otherwise, f(i, j) can be set as 1, since dungeon[i][j] is large enough for the requirement of next step, f(i+1, j) or f(i, j+1). Thus,

f(i, j) = val <= 0 ? 1 : val

f(0, 0) would be the final result wanted.


See the code below:

class Solution {
public:
    int calculateMinimumHP(vector<vector<int>>& dungeon) {
        if(!dungeon.size() || !dungeon.front().size()) return 0;
        int m = dungeon.size(), n = dungeon.front().size();
        vector<vector<int>> dp(m+1, vector<int>(n+1, INT_MAX));
        dp[m-1][n-1] = dungeon[m-1][n-1] >= 0 ? 1 : 1 - dungeon[m-1][n-1]; 
        for(int i=m-1; i>=0; --i) {
            for(int j=n-1; j>=0; --j) {
                if(i==m-1 && j==n-1) continue;
                int val = min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j];
                dp[i][j] = (val <= 0 ? 1 : val);
            }
        }
        return dp[0][0];
    }
};


Based on the "rolling array" trick, the space complexity can be reduced to O(n). 

See the code below:


class Solution {
public:
    int calculateMinimumHP(vector<vector<int>>& dungeon) {
        if(!dungeon.size() || !dungeon.front().size()) return 0;
        int m = dungeon.size(), n = dungeon.front().size();
        vector<int> dp(n+1, INT_MAX);
        dp[n-1] = dungeon[m-1][n-1] >= 0 ? 1 : 1 - dungeon[m-1][n-1]; 
        for(int i=m-1; i>=0; --i) {
            for(int j=n-1; j>=0; --j) {
                if(i==m-1 && j==n-1) continue;
                int val = min(dp[j], dp[j+1]) - dungeon[i][j];
                dp[j] = (val <= 0 ? 1 : val);
            }
        }
        return dp[0];
    }
};


If still want to start from the left top corner, a different algorithm can be applied: binary search.

The basic idea is that we first make a guess of the initial value: mid. Then we do a check to see whether the knight can reach the end point or not with mid health point. If no, the search range becomes the larger half; if yes, the search range is narrowed down to the smaller half.

See the code below:


class Solution {
public:
    int calculateMinimumHP(vector<vector<int>>& dungeon) {
        if(!dungeon.size() || !dungeon.front().size()) return 1;
        int left = 1, right = INT_MAX;
        while(left < right) {
            int mid = left + (right - left) /2;
            if(!isV(dungeon, mid)) left = mid + 1;
            else right = mid;
        }
        return left;
    }
private:
    bool isV(vector<vector<int>>& vs, int val) {
        int m = vs.size(), n = vs.front().size();
        vector<vector<int>> dp(m+1, vector<int>(n+1, 0));
        dp[1][1] = vs[0][0] + val;
        if(dp[1][1] <= 0) return false;
        for(int i=1; i<=m; ++i) {
            for(int j=1; j<=n; ++j) {
                if(i==1 && j==1) continue;
                int t = max(dp[i][j-1], dp[i-1][j]);
                dp[i][j] = t <= 0 ? -1 : (t + vs[i-1][j-1]);
            }
        }
        return dp[m][n] > 0;
    }
};

Note:

The overall time complexity is O(m*n*log(INT_MAX)), so it is a factor of log(INT_MAX) larger than the dp method above. But this number is smaller, which is ~ 31 or 32.


Upper Layer

Comments

Post a Comment

Popular posts from this blog

Segment Tree

Segment tree can be viewed as an abstract data structure which using some more space to trade for speed. For example, for a typical question with O(N^2) time complexity, the segment tree method can decrease it to O(N*log(N)).  To make it understandable, let us consider one example. Say we have an integer array of N size, and what we want is to query the maximum with a query range [idx1, idx2], where idx1 is the left indexes, and idx2 is the right indexes inclusive. If we only do this kind of query once, then we just need to scan through the array from idx1 to idx2 once, and record the maximum, done. The time complexity is O(N), which is decent enough in most cases even though it is not the optimal one (for example, with a segment tree built, the time complexity can decrease down to O(log(N))). However, how about we need to query the array N times? If we continue to use the naïve way above, then the time complexity is O(N^2), since for each query we need to scan the query range once. We
Post a Comment
Read more

Binary Search - Hard Level - Question 3

Binary Search - Hard Level - Question 3 878. Nth Magical Number A positive integer is magical if it is divisible by either a or b. Given the three integers n, a, and b, return the nth magical number. Since the answer may be very large, return it modulo 10^9 + 7. Analysis: Let us consider some examples first. Example 1, a = 4, b = 2. If b is dividable by a, then all the numbers which is dividable by a should be dividable by b as well. So the nth magical number should be n*b; Example 2, a = 3, b = 2. The multiples of 2 are: 2, 4, 6, 8, 10, 12, ... The multiple of 3 are: 3, 6, 9, 12, ... So the overlap is related to the minimum common multiple between a and b, and we need to remove the overlap which is double-counted. So now, we make some conclusions: 1. the upper bound of the nth magical number should be n*b, where a is the smaller one (or b <= a); 2. there are n*b/a magical numbers smaller than n*b; 3. there are n*b/(minimum common multiple) overlaps. Thus, the overall count is: n +
Post a Comment
Read more

Recursion - Example

Recursion - Example Leetcode 231  Power of Two Given an integer n, return true if it is a power of two. Otherwise, return false. An integer n is a power of two, if there exists an integer x such that n == 2^x Constraints: -2^31 <= n <= 2^31 - 1 Analysis: One way is to think about this question recursively: if n%2 == 1, then n must not be power of 2; if not, then we just need to consider whether (n/2) is a power of 2 or not. This is exactly the "same question with a smaller size"! It is trivial to figure out the base cases: if n == 0, return false; if n == 1, return true. See the code below: class Solution { public: bool isPowerOfTwo(int n) { // base cases if(n == 0) return false; if(n == 1) return true; // converging if(n%2 == 1) return false; return isPowerOfTwo(n/2); } }; If interested, there are some other ways to solve this problem. For example, using bit manipulation, we can have the following solution: class
Post a Comment
Read more