Leetcode答题 --- 解码字母到整数映射

最新推荐文章于 2022-01-04 09:48:10 发布

soxiuzi

最新推荐文章于 2022-01-04 09:48:10 发布

阅读量274

点赞数

分类专栏： Leetcode解题记录 Javascript 文章标签： leetcode

本文链接：https://blog.csdn.net/soxiuzi/article/details/106541840

版权

Javascript 同时被 2 个专栏收录

52 篇文章 2 订阅

订阅专栏

Leetcode解题记录

51 篇文章 1 订阅

订阅专栏

题目

给你一个字符串 s，它由数字（'0' - '9'）和 '#' 组成。我们希望按下述规则将 s 映射为一些小写英文字符：

字符（'a' - 'i'）分别用（'1' - '9'）表示。
字符（'j' - 'z'）分别用（'10#' - '26#'）表示。 
返回映射之后形成的新字符串。

题目数据保证映射始终唯一

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/decrypt-string-from-alphabet-to-integer-mapping

示例

输入：s = "10#11#12"
输出："jkab"
解释："j" -> "10#" , "k" -> "11#" , "a" -> "1" , "b" -> "2".

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/decrypt-string-from-alphabet-to-integer-mapping

思路

一开始准备用正则exec函数来做，没做出来。方法是看题解的。

实现

var freqAlphabets = function(s) {
  const map = {"1":"a","2":"b","3":"c","4":"d","5":"e","6":"f","7":"g","8":"h","9":"i","10":"j","11":"k","12":"l","13":"m","14":"n","15":"o","16":"p","17":"q","18":"r","19":"s","20":"t","21":"u","22":"v","23":"w","24":"x","25":"y","26":"z"};
  const stack = [];
  for (const char of s) {
    if (char !== '#') { stack.push(char); continue; }
    const digit = stack.pop();
    stack.push(map[(stack.pop() + digit)]);
  }
  let ret = '';
  for (const char of stack) {
    ret += char <= '9' ? map[char] : char;
  }
  return ret;
};