README_EN.md

1309. Decrypt String from Alphabet to Integer Mapping

中文文档

Description

Given a string s formed by digits ('0' - '9') and '#' . We want to map s to English lowercase characters as follows:

<li>Characters (<code>&#39;a&#39;</code> to <code>&#39;i&#39;)</code> are&nbsp;represented by&nbsp;(<code>&#39;1&#39;</code> to&nbsp;<code>&#39;9&#39;</code>)&nbsp;respectively.</li>

<li>Characters (<code>&#39;j&#39;</code> to <code>&#39;z&#39;)</code> are represented by (<code>&#39;10#&#39;</code>&nbsp;to&nbsp;<code>&#39;26#&#39;</code>)&nbsp;respectively.&nbsp;</li>

Return the string formed after mapping.

It's guaranteed 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:

Input: s = "1326#"

Output: "acz"

Example 3:

Input: s = "25#"

Output: "y"

Example 4:

Input: s = "12345678910#11#12#13#14#15#16#17#18#19#20#21#22#23#24#25#26#"

Output: "abcdefghijklmnopqrstuvwxyz"

 

Constraints:

<li><code>1 &lt;= s.length &lt;= 1000</code></li>

<li><code>s[i]</code> only contains digits letters (<code>&#39;0&#39;</code>-<code>&#39;9&#39;</code>) and <code>&#39;#&#39;</code>&nbsp;letter.</li>

<li><code>s</code> will be valid string&nbsp;such that mapping is always possible.</li>

Solutions

Python3

Java

...