[LeetCode] 639. Decode Ways II

A message containing letters from A-Z is being encoded to numbers using the following mapping way:
'A' -> 1
'B' -> 2
...
'Z' -> 26
Beyond that, now the encoded string can also contain the character '*', which can be treated as one of the numbers from 1 to 9.
Given the encoded message containing digits and the character '*', return the total number of ways to decode it.
Also, since the answer may be very large, you should return the output mod 109 + 7.
Example 1:
Input: "*"
Output: 9
Explanation: The encoded message can be decoded to the string: "A", "B", "C", "D", "E", "F", "G", "H", "I".
Example 2:
Input: "1*"
Output: 9 + 9 = 18
Note:
  1. The length of the input string will fit in range [1, 105].
  2. The input string will only contain the character '*' and digits '0' - '9'.

Thought process:
Dynamic programming.
  1. Sub-problem: find the total number of ways to decode a sub-string of s.
  2. Function:
    1. If s[i] == 0:
      1. If 0 < s[i - 1] <= 2, f[i] = f[i - 2].
      2. If s[i - 1] == *, * can be 1 or 2. f[i] = f[i - 2] * 2.
      3. Else, there is no way to decode it. Return 0.
    2. If s[i] > 0:
      1. If s[i - 1] != 0 and s[i - 1, i] <= 26, f[i] = f[i - 1] + f[i - 2].
      2. If s[i - 1] == *:
        1. If s[i] <= 6, * can be 1 or 2. f[i] = f[i - 1] + f[i - 2] * 2.
        2. Else, * can only be 1. f[i] = f[i - 1] + f[i - 2].
      3. Else, f[i] = f[i - 1].
    3. If s[i] == *:
      1. If s[i - 1] == 0, f[i] = f[i - 1] * 9.
      2. If s[i - 1] == 1, f[i] = f[i - 1] * 9 + f[i - 2] * 9.
      3. If s[i - 1] == 2, f[i] = f[i - 1] * 9 + f[i - 2] * 6.
      4. If s[i - 1] == *, f[i] = f[i - 1] * 9 + f[i - 2] * 15 
      5. Else, f[i] = f[i - 1] * 9.
  3. Initialization: f[0] = 1.
  4. Answer: f[s.length()].

Solution:

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
class Solution {
    public int numDecodings(String s) {
        if (s.length() == 0) {
            return 0;
        }
        
        long[] f = new long[s.length() + 1];
        f[0] = 1;
        int M = 1000000007;
        
        for (int i = 1; i < f.length; i++) {
            char c = s.charAt(i - 1);
            char previous = '#';
            if (i > 1) {
                previous = s.charAt(i - 2);
            }
            
            if (c == '0') {
                if (previous > '0' && previous <= '2') {
                    f[i] = f[i - 2];
                } else if (previous == '*') {
                    f[i] = (2 * f[i - 2]) % M;
                } else {
                    return 0;
                }
            } else if (c > '0') {
                if (previous == '*') {
                    if (c <= '6') {
                        f[i] = (f[i - 1] + 2 * f[i - 2]) % M;
                    } else {
                        f[i] = (f[i - 1] + f[i - 2]) % M;
                    }
                } else if (i > 1 && previous != '0' && Integer.parseInt(s.substring(i - 2, i)) <= 26) {
                    f[i] = (f[i - 1] + f[i - 2]) % M;
                } else {
                    f[i] = f[i - 1];
                }
            } else {
                f[i] = 9 * f[i - 1];
                if (previous == '1') {
                    f[i] = (f[i] + 9 * f[i - 2]) % M;
                } else if (previous == '2') {
                    f[i] = (f[i] + 6 * f[i - 2]) % M;
                } else if (previous == '*') {
                    f[i] = (f[i] + 15 * f[i - 2]) % M;
                }
            }
        }
        return (int) f[s.length()];
    }
}

Location: Philadelphia, PA, USA

Comments

Post a Comment

Popular posts from this blog

[LeetCode] 714. Best Time to Buy and Sell Stock with Transaction Fee

Your are given an array of integers  prices , for which the  i -th element is the price of a given stock on day  i ; and a non-negative integer  fee  representing a transaction fee. You may complete as many transactions as you like, but you need to pay the transaction fee for each transaction. You may not buy more than 1 share of a stock at a time (ie. you must sell the stock share before you buy again.) Return the maximum profit you can make. Example 1: Input: prices = [1, 3, 2, 8, 4, 9], fee = 2 Output: 8 Explanation: The maximum profit can be achieved by: Buying at prices[0] = 1 Selling at prices[3] = 8 Buying at prices[4] = 4 Selling at prices[5] = 9 The total profit is ((8 - 1) - 2) + ((9 - 4) - 2) = 8. Note: 0 < prices.length <= 50000 . 0 < prices[i] < 50000 . 0 <= fee < 50000 . Thought process: Each day there are two options, buy or sell. Use two variables buy and sell to keep track of the max profit. Solutio...
Read more

[LeetCode] 269. Alien Dictionary

There is a new alien language which uses the latin alphabet. However, the order among letters are unknown to you. You receive a list of  non-empty  words from the dictionary, where  words are sorted lexicographically by the rules of this new language . Derive the order of letters in this language. Example 1: Given the following words in dictionary, [ "wrt", "wrf", "er", "ett", "rftt" ] The correct order is:  "wertf" . Example 2: Given the following words in dictionary, [ "z", "x" ] The correct order is:  "zx" . Example 3: Given the following words in dictionary, [ "z", "x", "z" ] The order is invalid, so return  "" . Note: You may assume all letters are in lowercase. You may assume that if a is a prefix of b, then a must appear before b in the given dictionary. If the order is invalid, return an empty string...
Read more

[LeetCode] 410. Split Array Largest Sum

Given an array which consists of non-negative integers and an integer  m , you can split the array into  m  non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these  m  subarrays. Note: If  n  is the length of array, assume the following constraints are satisfied: 1 ≤  n  ≤ 1000 1 ≤  m  ≤ min(50,  n ) Examples: Input: nums = [7,2,5,10,8] m = 2 Output: 18 Explanation: There are four ways to split nums into two subarrays. The best way is to split it into [7,2,5] and [10,8] , where the largest sum among the two subarrays is only 18. Thought process: Binary search. The range of the answer is between max(nums) and sum(nums). Do a binary search on this range. For every mid value, I check if the array can be split into m sub-arrays, where each sub-array's sum <= mid. If I can, that means mid is too large. Keep the left half. If I can't, that means mid is too small. Keep the...
Read more