[LeetCode] Decode Ways（DP）

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.

就是要注意0的出现

class Solution {
public:
    int numDecodings(string s) {
        int len = s.size();
        if(len==)
            return ;
        vector<int> num(len,);//第i个位置记录从s的第0个位置开始到第i个位置共有几种解码方式
        if(len>= && s[]=='')
                 return ;

        num[] = ;
        if(len==)
            return num[];

        string s0 = s.substr(,);
        int d  = sToInt(s0);
        int n=;
        if(d> && d<= &&  d!=)
            num[] = ;
        else if((s[] =='' && (s[]==''|| s[]==''))||s[]!='')
            num[] = num[];
        else
            return ;

        for(int i=;i<len;i++){
            if(s[i-]==''){
                if(s[i]!=''){
                    num[i] = num[i-];
                    continue;
                }
                else
                    return ;
            }

            s0 = s.substr(i-,);
            d  = sToInt(s0);
            if(s[i]==''){
                if(d== || d==){
                   num[i] = num[i-];
                   continue;
                }

               else
                   return ;
            }

            if(d> && d<= )
                num[i] = num[i-]+num[i-];
            else
                num[i] = num[i-];

        }//end for
        return num[len-];
    }
private:
    int sToInt(string s){
      istringstream is(s);
      int d;
      is>>d;
      return d;

    }
};