Skip to main content

Dynamic Programming - Easy Level - Question 2

Dynamic Programming - Easy Level - Question 2


Leetcode 62 Unique Paths

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).

How many possible unique paths are there?

Constraints:

1 <= m, n <= 100

It's guaranteed that the answer will be less than or equal to 2 * 10^9.


Analysis:


We can apply the same idea in Question1 to the current one, which is from 1D to 2D.

One of the key information is: the robot can only go down or right. So if we define f[i][j] means the total number of ways to reach this position, then

f[i][j] = f[i-1][j] + f[i][j-1]

The first term on the right side is for "go right", and the second for "go down".

After having the state definition and transition formula, we just need to figure out the initial states' values.

Obviously the first row and the first column should always be 1, since there are only one way to reach them.

To simplify the code, usually we can define an extra row & column, and then just need to define f[1][1] = 1, which is enough for the initialization.


See the code below:


class Solution {
public:
    int uniquePaths(int m, int n) {
        vector<vector<int>> dp(m+1, vector<int>(n+1, 0));
        dp[1][1] = 1;
        for(int i=1; i<=m; ++i) {
            for(int j=1; j<=n; ++j) {
                if(i==1 && j==1) continue;
                dp[i][j] = dp[i-1][j] + dp[i][j-1];
            }
        }
        return dp[m][n];
    }
};

Both time and space complexity is O(m*n). The space complexity can be further reduced down to O(n) with the so-called "rolling array" idea, which is explained in the following,

The scanning order for the code above is top-down, and then for each row, it is from left to right. For each dp[i][j], we need its left neighbor and top neighbor. So if we reduce the 2D dp to 1D, we still need to scan from left to right (not the reverse). Why?

In the 2D dp case, when we calculate dp[i][j], dp[i][j-1] has been calculated at the current row; if we use 1D dp, scanning from left to right will use the updated dp[j-1], but scanning from right to left will use the un-updated dp[j-1], or the one from the previous loop. In this question, we need the updated one, so scan from left to right is needed.


See the code below:


class Solution {
public:
    int uniquePaths(int m, int n) {
        vector<int> dp(n, 1);
        for(int i=1; i<m; ++i) {
            for(int j=1; j<n; ++j) {
                dp[j] += dp[j-1];
            }
        }
        return dp[n-1];
    }
};

Note:

Like the Fibonacci sequence, this question also has directly mathematical formula: it is just like the permutation of  m color1 boxes with n color2 boxes, which is (m+n)!/(m!*n!). Such as small world, isn't it?


Upper Layer

Comments

Post a Comment

Popular posts from this blog

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

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...
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