# 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:

Input: s = "1326#"
Output: "acz"

Constraints:

• 1 <= s.length <= 1000
• s consists of digits and the '#' letter.
• s will be a valid string such that mapping is always possible.

class Solution {
public:
string freqAlphabets(string s) {
string res = "";
int n = s.size();
for (int i = 0; i < n; ++i) {
if (i + 2 < n && s[i + 2] == '#') {
res += (stoi(s.substr(i, 2)) - 1 + 'a');
i += 2;
} else {
res += (s[i] - '0' - 1 + 'a');
}
}
return res;
}
};

Github 同步地址:

https://github.com/grandyang/leetcode/issues/1309

https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping/

https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping/discuss/736309/C%2B%2B-0ms-solution

https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping/discuss/500231/HashMap-Solution-JAVA

LeetCode All in One 题目讲解汇总(持续更新中…)

（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，快快加入吧～）

|

Venmo 打赏

—|—

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation