LeetCode 91 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.

Example

Given encoded message “12”, it could be decoded as “AB” (1 2) or “L”(12).
The number of ways decoding “12” is 2.

解法

计算有多少种解码方式。解码方式要考虑当前元素和它的前一元素。
用nums[i]表示到第i个元素位置存在的解码方式的个数，nums中的元素初始化为0。nums[0] = 1
假设字符串为ABC…，当前元素为B
1. 如果B不是0, 即B在[1,9]之间，DP[i] += DP[i-1]
2. 如果AB在[10, 26]之间， DP[i] += DP[i+2]

class Solution {
public:
    int numDecodings(string s) {
        int l = s.length();
        if (l == 0 || s[0] == '0') return 0;
        int nums[l + 1] = {0};  
        nums[0] = 1; 
        for(int i = 1; i <= l; i++) {  
            if (s[i-1] != '0') nums[i] += nums[i-1];  
            if (i > 1 && s[i-2] == '1') nums[i] += nums[i-2];  
            if (i > 1 && s[i-2] == '2' && s[i-1] >= '0' && s[i-1] <= '6') nums[i] += nums[i-2];  
        }  
        return nums[l];
    }
};