分析
这题没什么好说的,类似脑筋急转弯。先将单独出现字母的数字拎出来。然后依赖现有的数字,去计算未知的数字。最后挨个输出即可。
严格来讲,这题可以用矩阵法则去解析,但想起来比较麻烦。详见简单的线性代数,快来复习吧-python
答案
class Solution:
def originalDigits(self, s: str) -> str:
nums = ["zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"]
m = Counter(s)
cnt = [0] * 10
cnt[0] = m["z"]
cnt[2] = m["w"]
cnt[4] = m["u"]
cnt[6] = m["x"]
cnt[8] = m["g"]
cnt[1] = m["o"] - cnt[0] - cnt[2] - cnt[4]
cnt[3] = m["r"] - cnt[0] - cnt[4]
cnt[5] = m["f"] - cnt[4]
cnt[7] = m["v"] - cnt[5]
cnt[9] = m["i"] - cnt[5] - cnt[6] - cnt[8]
res = ""
for i in range(10):
for c in range(cnt[i]):
res += chr(i + ord("0"))
return res
本题答案用到了python特有的Counter