Skip to main content

Dynamic Programming - Medium Level - Question 1

Dynamic Programming - Medium Level - Question 1


Leetcode 91 Decode ways

A message containing letters from A-Z can be encoded into numbers using the following mapping:

'A' -> "1"

'B' -> "2"

...

'Z' -> "26"

To decode an encoded message, all the digits must be grouped then mapped back into letters using the reverse of the mapping above (there may be multiple ways). For example, "11106" can be mapped into:

"AAJF" with the grouping (1 1 10 6)

"KJF" with the grouping (11 10 6)

Note that the grouping (1 11 06) is invalid because "06" cannot be mapped into 'F' since "6" is different from "06".

Given a string s containing only digits, return the number of ways to decode it.

The answer is guaranteed to fit in a 32-bit integer.

Constraints:

1 <= s.length <= 100

s contains only digits and may contain leading zero(s).


Analysis:

We can define f(i) as the number of ways to decode the string to the ith position.

Similar to Climbing Stairs, f(i) can be derived from f(i-1) and f(i-2). (or for each char, we at most just need to consider the previous char).

case 1. If s[i] itself is a valid choice, such as '1', '2', ... '9'; then one way to decode the string to the ith position is decoding the s[0, i-1] and the ith, and the number of ways to decode in this way is f(i-1). 

case 2. If s[i] can be connected with the previous char, then we can decode the string to the ith position as s[0, i-2] + s[i-1, i], and the number of ways to decode in this way is f(i-2).

For each char, 

if only 1 valid, then f(i) = f(i-1); 

else if only 2 valid, then f(i) = f(i-2);

else if both valid, then f(i) = f(i-1) + f(i-2)

else return 0. 

So now the question becomes how to categorize the question based on the value of s[i].  

At each position i, we have 10 possibilities, s[i] could be 0, 1, 2, ..., 9, which gives the range of discussion.

If the first char is '0', then there is no way to decode, game over;

In general, if s[i] == '0', then the s[i-1] has to be '1' or '2' (otherwise, there is no way to decode), and it has to connect with the previous char (since itself cannot be decoded), which is case 2; 

If s[i-1] == '0' or s[i-1] > '2', then s[i-1] cannot be connected with s[i], which is case 1;

If s[i-1] == '2' or s[i] > '6', then s[i-1] cannot be connected with s[i] neither, which is case 1;

For all the rest case,  both 1 and 2 ways are valid, so f[i] = f[i-1] + f[i-2].


See the code below:


class Solution {
public:
    int numDecodings(string s) {
        if(!s.size() || s[0] == '0') return 0;
        int n = s.size();
        vector<int> dp(n+1, 0);
        dp[0] = dp[1] = 1;
        for(int i=2; i<=n; ++i) {
            int cur = s[i-1] - '0', pre = s[i-2] - '0';
            // case 2
            if(cur == 0) dp[i] = (pre == 0 || pre > 2) ? 0 : dp[i-2];
            // case 1
            else if(pre > 2 || pre == 0 || cur > 6 && pre == 2) dp[i] = dp[i-1];
            // case 1 + 2
            else dp[i] = dp[i-1] + dp[i-2];
        }
        return dp[n];
    }
};


Since we just need the last two elements of the dp array, the space can be reduced to constant.

See the code below,

class Solution {
public:
    int numDecodings(string s) {
        if(!s.size() || s[0] == '0') return 0;
        int n = s.size();
        int a = 1, b = 1, c = 1;
        for(int i=1; i<n; ++i) {
            int cur = s[i] - '0', pre = s[i-1] - '0';
            if(cur == 0) c = (pre == 0 || pre > 2) ? 0 : a;
            else if(pre > 2 || pre == 0 || cur > 6 && pre == 2) c = b;
            else c = a + b;
            a = b;
            b = c;
        }
        return c;
    }
};



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