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 a non-empty string containing only digits, determine the total number of ways to decode it.

Example 1:

Input: "12"
Output: 2
Explanation: It could be decoded as "AB" (1 2) or "L" (12).

Example 2:

Input: "226"
Output: 3
Explanation: It could be decoded as "BZ" (2 26), "VF" (22 6), or "BBF" (2 2 6).

 

代码：

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