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.

思路：

典型的动规，用n[i]表示从i到末尾的表示法，然后对于每一个i，判断s[i]和s[i]+s[j]能否解码，再分别加上n[i+1]和n[i+2]即可。

代码：

    int numDecodings(string s) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int l = s.length();
        if(l == 0)
            return 0;
        if(l == 1)
            return s[0] > '0';
        int ways[l];
        int i;
        ways[l-1] = s[l-1] > '0';
        if(s[l-2] == '0')
            ways[l-2] = 0;
        else{
            if((s[l-2]-'0')*10+s[l-1]-'0' <= 26)
                ways[l-2] = ways[l-1] + 1;
            else
                ways[l-2] = ways[l-1];
        }
        for(i = l-3; i >= 0; i--){
            if(s[i] == '0'){
                ways[i] = 0;
                continue;
            }
            int tmp = (s[i]-'0')*10+s[i+1]-'0';
            if(tmp <= 26)
                ways[i] = ways[i+1] + ways[i+2];
            else
                ways[i] = ways[i+1];
        }
        return ways[0];
    }

 第二遍

    int numDecodings(string s) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int l = s.length();
        if(l == 0)
            return 0;
        if(l == 1)
            return s[0]>'0';
        int result[l+1];
        result[l-1] = s[l-1]>'0';
        result[l] = 1;
        for(int i = l-2; i >= 0; i--){
            if(s[i] == '0')
                result[i] = 0;
            else{
                int tmp = 10*(s[i]-'0')+s[i+1]-'0';
                if(tmp <= 26)
                    result[i] = result[i+1]+result[i+2];
                else
                    result[i] = result[i+1];
            }
        }
        return result[0];
    }