Skip to content
On this page

423. 从英文中重建数字

原题链接:LeetCode 423. 从英文中重建数字

题目描述

给你一个字符串 s ,其中包含字母顺序打乱的用英文单词表示的若干数字(0-9)。按 升序 返回原始的数字。

示例 1:

  • 输入: s = "owoztneoer"
  • 输出: "012"

示例 2:

  • 输入: s = "fviefuro"
  • 输出: "45"

提示:

  • 1 <= s.length <= 105

  • s[i]["e","g","f","i","h","o","n","s","r","u","t","w","v","x","z"] 这些字符之一

  • s 保证是一个符合题目要求的字符串

难度: Medium


题解代码

javascript
/**
 * @param {string} s
 * @return {string}
 */
var originalDigits = function(s) {
  // zero one two three four five six seven eight nine

  // ["e","g","f","i","h","o","n","s","r","u","t","w","v","x","z"]
  const hash = {}
  for (let i = 0 ; i < s.length; i++) {
    hash[s[i]] = (hash[s[i]] || 0) + 1 
  }

  const arr = ['zero', 'one', 'two', ',three', 'four', 'five', 'six', 'seven', 'eight', 'nine']
  for (let i = 0; i < 9; i++) {
    const letter = arr[i]
    let min = Infinity
  }
  // 001
  // zerozeroone
};

技术文档集合