LeetCode --- 1309. Decrypt String from Alphabet to Integer Mapping 解题报告

Posted 2022-10-07 杨鑫newlfe

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了LeetCode --- 1309. Decrypt String from Alphabet to Integer Mapping 解题报告相关的知识，希望对你有一定的参考价值。

You are given a string s formed by digits and \'#\'. We want to map s to English lowercase characters as follows:

Characters (\'a\' to \'i\') are represented by (\'1\' to \'9\') respectively.
Characters (\'j\' to \'z\') are represented by (\'10#\' to \'26#\') respectively.

Return the string formed after mapping.

The test cases are generated so that a unique mapping will always exist.

Example 1:

Input: s = "10#11#12"
Output: "jkab"
Explanation: "j" -> "10#" , "k" -> "11#" , "a" -> "1" , "b" -> "2".

Example 2:

以上是关于LeetCode --- 1309. Decrypt String from Alphabet to Integer Mapping 解题报告的主要内容，如果未能解决你的问题，请参考以下文章