[LeetCode] Decode Ways

来源：互联网发布：用户体验知乎编辑：程序博客网时间：2024/06/06 01:29

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.

class Solution {public:    int numDecodings(string s) {        int *dp = new int[s.size()];        memset(dp,0,sizeof(int)*s.size());        if(s.size() == 0) return 0;        if(s.size() == 1) return s[0] == '0' ? 0 : 1;        if(s.size() == 2) return (s[0] != '0' && s[1] != '0' ? 1 : 0) + (s[0] != '0' && ((s[0] - '0') * 10 + s[1] - '0') <= 26 ? 1 : 0);                dp[0] = s[0] == '0' ? 0 : 1;        dp[1] = (s[0] != '0' && s[1] != '0' ? 1 : 0) + (s[0] != '0' && ((s[0] - '0') * 10 + s[1] - '0') <= 26 ? 1 : 0);                for(int i = 2;i < s.size();i ++){            if(s[i] != '0')                dp[i] += dp[i - 1];            if(s[i - 1] != '0' && ((s[i - 1] - '0') * 10 + s[i] - '0') <= 26)                dp[i] += dp[i - 2];        }        return dp[s.size() - 1];    }};

0 0