最强解析面试题:Decode Ways
文章讲解 “ 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.
For example,
Given encoded message “12”, it could be decoded as “AB” (1 2) or “L” (12).
The number of ways decoding “12” is 2.
示例1
Input: s = “12”
Output: 2
Explanation: “12” 可以被解析成 “AB” (1 2) 或者 “L” (12).