LeetCode算法系列：91.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 a non-empty string containing only digits, determine the total number of ways to decode it.

Example 1:

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

Example 2:

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

算法实现：

用动态规划的方法

只需要明确递归的条件即可，关于到第i位能够decode的方法数

• 如果第i位不为0，那么可以是到第i-1位的各种decode方案加上第i位的数据
• 如果第i - 1位不为0且第i-1和第i位组成的数据在1-26之间，那么可以是到第i-2位的各种decode方案加上这两位的数据

即r[i] = r[i - 1]*bool(第i位不为0) + r[i - 2]*bool(第i - 1位不为0且第i-1和第i位组成的数据在1-26之间)

class Solution {
public:
    int numDecodings(string s) {
        if(s.empty())return 0;
        int n = s.length();
        vector<int> r(n,0);
        if(s[0] != '0')r[0] = 1;
        for(int i = 1; i < n; i ++){
            if(s[i] > '0')
                r[i] += r[i - 1];
            int suanz = (s[i - 1] - '0')*10 + s[i] - '0';
            if(s[i - 1] > '0' && suanz <= 26 && suanz > 0)
            {
                if(i > 1)
                    r[i] += r[i - 2];
                else
                    r[i] ++;
            }
        }
        return r[n - 1];
    }
};