leetcode-----91. 解码方法

• 链接：https://leetcode-cn.com/problems/decode-ways/

代码

class Solution {
public:
    int numDecodings(string s) {
        int n = s.size();
        s = ‘ ‘ + s;
        vector<int> f(n + 1);
        f[0] = 1;
        for (int i = 1; i <= n; ++i) {
            if (s[i] >= ‘1‘ && s[i] <= ‘9‘) f[i] += f[i - 1];
            if (i > 1) {
                int t = (s[i - 1] - ‘0‘) * 10 + s[i] - ‘0‘;
                if (t >= 10 && t <= 26) f[i] += f[i - 2];
            }
        }
        return f[n];
    }
};

leetcode-----91. 解码方法

原文：https://www.cnblogs.com/clown9804/p/13325069.html