给你一个字符串 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 保证是一个符合题目要求的字符串
方法一:依次确定每一个数字的次数
思路与算法
首先我们可以统计每个字母分别在哪些数字中出现:
Repeat()函数
//Repeat()函数的功能是把切片b复制count个,然后合成一个新的字节切片返回. func Repeat(b[]byte,count int) []byte
func originalDigits(s string) string {
c := map[rune]int{}
for _, ch := range s {
c[ch]++
}
cnt := [10]int{}
cnt[0] = c['z']
cnt[2] = c['w']
cnt[4] = c['u']
cnt[6] = c['x']
cnt[8] = c['g']
cnt[3] = c['h'] - cnt[8]
cnt[5] = c['f'] - cnt[4]
cnt[7] = c['s'] - cnt[6]
cnt[1] = c['o'] - cnt[0] - cnt[2] - cnt[4]
cnt[9] = c['i'] - cnt[5] - cnt[6] - cnt[8]
ans := []byte{}
for i, c := range cnt {
ans = append(ans, bytes.Repeat([]byte{byte('0' + i)}, c)...)
}
return string(ans)
}