每日一题 day 41 (DP topic)

problem

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 test cases are generated so that the answer fits in a 32-bit integer.

Example 1:

Input: s = "12"
Output: 2
Explanation: "12" could be decoded as "AB" (1 2) or "L" (12).

Example 2:

Input: s = "226"
Output: 3
Explanation: "226" could be decoded as "BZ" (2 26), "VF" (22 6), or "BBF" (2 2 6).

Example 3:

Input: s = "06"
Output: 0
Explanation: "06" cannot be mapped to "F" because of the leading zero ("6" is different from "06").

wrong approach

class Solution {
public:
    int search(int curr, int len, string s){
        if(s[curr+1]=='0' && len==1)return 0;
        if(len==2 && stoi(s.substr(curr, 2))>26)return 0
        if(curr == s.size()-1){
            if(s[curr] != '0')return 1;
            else return 0
        }
        if(curr == s.size()-2){
            return 1+search(cur+1, 1, s);
        }
        
        if(len==1){
            return search(cur+1, 1, s) + search(cur+1, 2, s);
        }else{
            return search(cur+2, 1, s) + search(cur+2, 2, s);
        }
    }
    
    int numDecodings(string s) {
        return search(0, 1, s) + search(0, 2, s);  
    }
};

wrong approach tle

class Solution {
public:
    
    int search(int cur, string s, int n){
        if(cur < n && s[cur]=='0')return 0;
        if(cur >= n) return 1;
        int res = search(cur+1, s, n);
        if(cur+1 < n && stoi(s.substr(cur, 2)) <=26)
            res += search(cur+2, s, n);
        return res;
    }
    
    int numDecodings(string s) {
        return search(0, s, s.size());
    }
};

dfs + memorization

class Solution {
public:
    int dp[102];
    int search(int cur, string s, int n){
        if(cur < n && s[cur]=='0')return 0;
        if(cur >= n) return 1;
        if(dp[cur] != -1)return dp[cur];
        int res = search(cur+1, s, n);
        if(cur+1 < n && stoi(s.substr(cur, 2)) <=26)
            res += search(cur+2, s, n);
        return dp[cur] = res;
    }
    
    int numDecodings(string s) {
        memset(dp, -1, sizeof(dp));
        return search(0, s, s.size());
    }
};