本文最后更新于226 天前,其中的信息可能已经过时,如有错误请发送邮件到2446865563@qq.com
1.题目基本信息
1.1.题目描述
给你一个字符串 s ,其中包含字母顺序打乱的用英文单词表示的若干数字(0-9)。按 升序 返回原始的数字。
1.2.题目地址
https://leetcode.cn/problems/reconstruct-original-digits-from-english/description/
2.解题方法
2.1.解题思路
对数字中的字母进行唯一性分析,依次推导并统计频率
3.解题代码
python代码
class Solution:
def originalDigits(self, s: str) -> str:
# 思路:对数字中的字母进行唯一性分析,依次推导并统计频率
cnts = Counter(s)
freq = [0] * 10
freq[8] = cnts['g']
freq[4] = cnts['u']
freq[2] = cnts['w']
freq[6] = cnts['x']
freq[0] = cnts['z']
freq[5] = cnts['f'] - freq[4]
freq[3] = cnts['h'] - freq[8]
freq[7] = cnts['s'] - freq[6]
freq[1] = cnts['o'] - freq[0] - freq[2] - freq[4]
freq[9] = cnts['i'] - freq[5] - freq[6] - freq[8]
result = ""
for i in range(10):
result += str(i) * freq[i]
return result
4.执行结果










