LeetCode | 639. Decode Ways II

最新推荐文章于 2024-10-06 13:05:10 发布

1LOVESJohnny

最新推荐文章于 2024-10-06 13:05:10 发布

阅读量351

点赞数

分类专栏： LeetCode 文章标签：编码解码动态规划字符串处理算法数学

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/124519764

版权

LeetCode 专栏收录该内容

285 篇文章 0 订阅

订阅专栏

.

题目

A message containing letters from A-Z can be encoded into numbers using the following mapping:

‘A’ -> “1”
‘B’ -> “2”
…
‘Z’ -> “26”
To decode an encoded message, all the digits must be grouped then mapped back into letters using the reverse of the mapping above (there may be multiple ways). For example, “11106” can be mapped into:

“AAJF” with the grouping (1 1 10 6)
“KJF” with the grouping (11 10 6)
Note that the grouping (1 11 06) is invalid because “06” cannot be mapped into ‘F’ since “6” is different from “06”.

In addition to the mapping above, an encoded message may contain the '’ character, which can represent any digit from ‘1’ to ‘9’ (‘0’ is excluded). For example, the encoded message "1" may represent any of the encoded messages “11”, “12”, “13”, “14”, “15”, “16”, “17”, “18”, or “19”. Decoding “1*” is equivalent to decoding any of the encoded messages it can represent.

Given a string s consisting of digits and ‘*’ characters, return the number of ways to decode it.

Since the answer may be very large, return it modulo 109 + 7.

.

Example 1:

Input: s = “"
Output: 9
Explanation: The encoded message can represent any of the encoded messages “1”, “2”, “3”, “4”, “5”, “6”, “7”, “8”, or “9”.
Each of these can be decoded to the strings “A”, “B”, “C”, “D”, “E”, “F”, “G”, “H”, and “I” respectively.
Hence, there are a total of 9 ways to decode "”.

.

Example 2:

Input: s = “1*”
Output: 18
Explanation: The encoded message can represent any of the encoded messages “11”, “12”, “13”, “14”, “15”, “16”, “17”, “18”, or “19”.
Each of these encoded messages have 2 ways to be decoded (e.g. “11” can be decoded to “AA” or “K”).
Hence, there are a total of 9 * 2 = 18 ways to decode “1*”.

.

Example 3:

Input: s = “2*”
Output: 15
Explanation: The encoded message can represent any of the encoded messages “21”, “22”, “23”, “24”, “25”, “26”, “27”, “28”, or “29”.
“21”, “22”, “23”, “24”, “25”, and “26” have 2 ways of being decoded, but “27”, “28”, and “29” only have 1 way.
Hence, there are a total of (6 * 2) + (3 * 1) = 12 + 3 = 15 ways to decode “2*”.

.

Constraints:

1 <= s.length <= 105
s[i] is a digit or ‘*’.

.

代码

class Solution {
public:
    int numDecodings(string s) {
        int length = s.length();
		vector<long long> 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] >= '0' && s[i] <= '9') || (s[i - 1] == '2' && s[i] >= '0' && s[i] <= '6'))
				dp[i + 2] += dp[i];
			if (s[i] == '*')
				dp[i + 2] += (dp[i + 1] * 9);
			if (i > 0 && (s[i - 1] == '1' && s[i] == '*'))
				dp[i + 2] += (dp[i] * 9);
			if (i > 0 && (s[i - 1] == '2' && s[i] == '*'))
				dp[i + 2] += (dp[i] * 6);
			if (i > 0 && s[i - 1] == '*')
				if (s[i] == '*')
					dp[i + 2] += (dp[i] * 15);
				else if (s[i] >= '0' && s[i] <= '6')
					dp[i + 2] += (dp[i] * 2);
				else
					dp[i + 2] += (dp[i]);
			dp[i + 2] %= (1000000000 + 7);
		}
		return dp[length + 1] % ( 1000000000 + 7);
    }
};