[leetcode]91. Decode Ways 解码方式

标签：mapping   message   example   from   follow   nta   code   ini   encode   

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).

[leetcode]91. Decode Ways 解码方式

标签：mapping   message   example   from   follow   nta   code   ini   encode   

原文地址：https://www.cnblogs.com/liuliu5151/p/9808268.html