刷题-decode ways

题目描述

A message containing letters fromA-Zis 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.

解题思路：答案只需求方案数，不用真的实现字母转换，递推式求解即可。要注意几个特殊情况：
1、0不没有对应的字母。
2、两位数不能以0开头，且不大于26。
3、如果有连续的0出现，即00、000，方案数一定是0。
如果没有遇到以上情况，递推式为：dp[i] = dp[i-1] + dp[i-2];

#include <iostream>
using namespace std;
int numDecodings(string s) {
    int n = s.length();
    if(n == 0 || n == 1 && s[0] == '0')
        return 0;
    else if(n == 1)
        return 1;
    int dp[n+5];
    memset(dp,0,sizeof(dp));
    if(s[0]!='0' && s[1] != '0')   //如果是10的话，dp[0]是0；
        dp[0] = 1;
    int x = (s[0] - '0') * 10 + (s[1] - '0');
    if(x <= 26 && x > 9){
        dp[1] = dp[0] + 1;
    }
    else{
        dp[1] = dp[0];
    }
    for(int i = 2;i < n ;i++){
        x = (s[i - 1] - '0') * 10 + (s[i] - '0');
        if(x == 0){
            dp[i] = 0;
            break;
        }
        if(s[i] != '0' && x <= 26 && x > 9){
            dp[i] = dp[i-1] + dp[i-2];
        }else if(x > 26 || x <= 9){
            if(s[i] == '0')
                dp[i] = 0;
            else
                dp[i] = dp[i-1];
        }else{
            dp[i] = dp[i-2];   //如310,s[i]=0,dp[i]=dp[i-2]
        }
    }
    return dp[n-1];
}
int main(){
    string s;
    cin>>s;
    int result=numDecodings(s);
    cout<<result<<endl;
}