package
0.0.0-20190725034537-db5e768ce8c3
Repository: https://github.com/frankegoesdown/leetcode-in-go.git
Documentation: pkg.go.dev

# README

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

解题思路

见程序注释