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