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

Popular posts from this blog

Brute Force - Question 2

2105. Watering Plants II Alice and Bob want to water n plants in their garden. The plants are arranged in a row and are labeled from 0 to n - 1 from left to right where the ith plant is located at x = i. Each plant needs a specific amount of water. Alice and Bob have a watering can each, initially full. They water the plants in the following way: Alice waters the plants in order from left to right, starting from the 0th plant. Bob waters the plants in order from right to left, starting from the (n - 1)th plant. They begin watering the plants simultaneously. It takes the same amount of time to water each plant regardless of how much water it needs. Alice/Bob must water the plant if they have enough in their can to fully water it. Otherwise, they first refill their can (instantaneously) then water the plant. In case both Alice and Bob reach the same plant, the one with more water currently in his/her watering can should water this plant. If they have the same amount of water, then Alice ...

Sweep Line

Sweep (or scanning) line algorithm is very efficient for some specific questions involving discrete intervals. The intervals could be the lasting time of events, or the width of a building or an abstract square, etc. In the scanning line algorithm, we usually need to distinguish the start and the end of an interval. After the labeling of the starts and ends, we can sort them together based on the values of the starts and ends. Thus, if there are N intervals in total, we will have 2*N data points (since each interval will contribute 2). The sorting becomes the most time-consuming step, which is O(2N*log(2N) ~ O(N*logN). After the sorting, we usually can run a linear sweep for all the data points. If the data point is labeled as a starting point, it means a new interval is in the processing; when an ending time is reached, it means one of the interval has ended. In such direct way, we can easily figure out how many intervals are in the processes. Other related information can also be obt...

Dynamic Programming - Easy Level - Question 1

Dynamic Programming - Easy Level - Question 1 Leetcode 1646  Get Maximum in Generated Array You are given an integer n. An array nums of length n + 1 is generated in the following way: nums[0] = 0 nums[1] = 1 nums[2 * i] = nums[i] when 2 <= 2 * i <= n nums[2 * i + 1] = nums[i] + nums[i + 1] when 2 <= 2 * i + 1 <= n Return the maximum integer in the array nums​​​. Constraints: 0 <= n <= 100 Analysis: This question is quick straightforward: the state and transitional formula are given; the initialization is also given. So we can just ready the code to iterate all the states and find the maximum. See the code below: class Solution { public: int getMaximumGenerated(int n) { int res = 0; if(n<2) return n; vector<int> f(n+1, 0); f[1] = 1; for(int i=2; i<=n; ++i) { if(i&1) f[i] = f[i/2] + f[i/2+1]; else f[i] = f[i/2]; // cout<<i<<" "<<f[i]<<endl; ...