[Leetcode]Decode Ways

Decode Ways
Total Accepted: 55623 Total Submissions: 331926 Difficulty: Medium

A message containing letters from A-Z is being encoded to numbers using the following mapping:

‘A’ -> 1
‘B’ -> 2
…
‘Z’ -> 26

Given an encoded message containing digits, determine the total number of ways to decode it.

For example,
Given encoded message “12”, it could be decoded as “AB” (1 2) or “L” (12).

The number of ways decoding “12” is 2.

Subscribe to see which companies asked this question

一道动态规划题，我没记错的话是我自己独立完成的一道动态规划题。原先做动规总是没想法，今天做出来这一道感觉更有自信了。

思路：dp[i] 表示前i个字符构成的字符串有几种解码方式。而后考虑dp[i + 1]，如果s[i - 1]和s[i]构成的字符串sLastTwo和s[i]构成的字符串sLastOne都能够表示一个字符的话。那么dp[i + 1] = dp[i] + dp[i - 1];
看个例子，字符串s = “1211”，此时i为3.因为”11”和”1”都能够表示一个字符。所以dp[4] = dp[3] + dp[2];
其他情况也跟这种基本情况类似，就不写了。

class Solution {
public:
    int numDecodings(string s) {
        int len = s.size();
        if(len == 0 || s[0] == '0')    return 0;
        vector<int> dp(len + 1,0);
        dp[0] = 1;
        if(isAlpha(s.substr(0,1)))
            dp[1] = 1;
        string sLastTwo(2,'0');
        string sLastOne(1,'0');
        for(int i = 1;i <= len - 1;++ i){
            sLastTwo[0] = s[i - 1];
            sLastTwo[1] = sLastOne[0] = s[i];
            if(isAlpha(sLastTwo) && isAlpha(sLastOne)){
                dp[i + 1] = dp[i] + dp[i - 1];
            }
            else if(!isAlpha(sLastTwo) && isAlpha(sLastOne)){
                dp[i + 1] = dp[i];
            }
            else if(isAlpha(sLastTwo) && !isAlpha(sLastOne)){
                dp[i + 1] = dp[i - 1];
            }
            else{
                return 0;
            }
        }
        return dp[len];
    }
private:
    bool isAlpha(string str){
        int num = stoi(str);
        if(str[0] == '0')
            return false;
        if(num <= 26 && num >= 1)
            return true;
        else return false;
    }
};