leetcode 423.从英文中重建数字【哈希表+字符串】

在这里插入图片描述
思路:
找出每个数字的英文单词中独特的字符,或独特字符的个数的差。

code:

"""
找出每个数字的英文单词中独特的字符,或独特字符的个数的差
"""
class Solution:
    def originalDigits(self, s: str) -> str:
        ch = ["e","g","f","i","h","o","n","s","r","u","t","w","v","x","z"]
        # 哈希表。存储每个字符的个数
        num = dict()
        for c in ch:
            num[c] = 0
        for ch in s:
            num[ch] += 1
        
        # 用数字的英文单词的独特字符表示 数字 
        n = [0 for _ in range(10)]
        n[0] = num['z']
        n[2] = num['w']
        n[4] = num['u']
        n[6] = num['x']
        n[8] = num['g']
        n[1] = num['o'] - n[0] - n[2] - n[4]
        n[3] = num['t'] - n[2] - n[8]
        n[5] = num['f'] - n[4]
        n[7] = num['v'] - n[5]
        n[9] = num['i'] - n[6] - n[8] - n[5]
        return ''.join([str(i) for i in range(10) 
                            for j in range(n[i])
                        ])
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值