解码方法

꧃小王同学ꦺ

于 2021-04-21 19:59:13 发布

阅读量3.9k

点赞数 2

分类专栏：每日一题文章标签：算法数据结构 leetcode

本文链接：https://blog.csdn.net/qq_45518315/article/details/115975464

版权

给定一个只包含数字的字符串s，计算按照特定规则解码它的方法数。使用动态规划算法，根据字符串的每个字符及其组合判断解码方式，递归地计算解码方法数。例如，输入s='112'，解码方法数为3。

摘要由CSDN通过智能技术生成

Decode Ways

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

‘A’ -> “1”

‘B’ -> “2”

…

‘Z’ -> “26”

To decode the 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”.

Given a string s containing only digits, return the number of ways to decode it.

The answer is guaranteed to fit in a 32-bit integer.

Example 1:

Input: s = “12”

Output: 2

Explanation: “12” could be decoded as “AB”(1, 2) or “L”(12).

Example 2:

Input: s = “226”

Output: 3

Explanation: “226” could be decoded as “BZ”(2, 26), “VF”(22, 6), or “BBF”(2, 2, 6).

Example 3:

Input: s = “0”

Output: 0

Explanation: There is no character that is mapped to a number starting with 0.

The only valid mappings with 0 are ‘J’ -> “10” and ‘T’ -> “20”, neither of which start with 0.

Hance, there are no valid ways to decode this since all digits need to be mapped.

Example 4: