前往小程序,Get更优阅读体验!
立即前往
首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >Leetcode 423. Reconstruct Original Digits from English

Leetcode 423. Reconstruct Original Digits from English

作者头像
Tyan
发布2021-07-15 14:06:02
2400
发布2021-07-15 14:06:02
举报
文章被收录于专栏:SnailTyanSnailTyan

1. Description

Reconstruct Original Digits from English
Reconstruct Original Digits from English

2. Solution

**解析:**Version 1,找出0-9英文字母个数与数字个数的对应关系,然后根据统计的字符数计算对应的数字个数,按顺序构造最后的字符串即可。

  • Version 1
代码语言:javascript
复制
class Solution:
    def originalDigits(self, s: str) -> str:        
        chars = ["e", "g", "f", "i", "h", "o", "n", "s", "r", "u", "t", "w", "v", "x", "z"]
        stat = {ch: 0 for ch in chars}
        for ch in s:
            stat[ch] += 1

        result = ''
        result += '0' * stat['z']
        result += '1' * (stat['o'] - stat['z'] - stat['w'] - stat['u'])
        result += '2' * stat['w']
        result += '3' * (stat['r'] - stat['z'] - stat['u'])
        result += '4' * stat['u']
        result += '5' * (stat['f'] - stat['u'])
        result += '6' * stat['x']
        result += '7' * (stat['v'] - (stat['f'] - stat['u']))
        result += '8' * stat['g']
        result += '9' * (stat['i'] - (stat['f'] - stat['u']) - stat['x'] - stat['g'])
        return result

Reference

  1. https://leetcode.com/problems/reconstruct-original-digits-from-english/
本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
原始发表:2021-07-14 ,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体同步曝光计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
目录
  • 1. Description
  • 2. Solution
  • Reference
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档