Decode Ways

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.

经典的动态规划

第x个数字的可编码总数量依赖于前两个数量，设第x个编码数量为f(x)

则很容易找到关系

f(x) = f(x-1) + f(x-2)   如果x和x-1可以合并且x!='0'

f(x) =f(x-2) 如果x和x-1可以合并但x=='0'

f(x) = f(x-1) 如果不能和x-1合并且x!='0'

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