[leetcode]423. Reconstruct Original Digits from English

最新推荐文章于 2025-06-30 00:56:17 发布

xiaocong1990

最新推荐文章于 2025-06-30 00:56:17 发布

阅读量431

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/xiaocong1990/article/details/54565295

leetcode 专栏收录该内容

473 篇文章

订阅专栏

本文介绍了一种算法，该算法可以从乱序的英文数字描述中提取并按升序排列数字0-9。通过分析特定字母出现的次数来确定每个数字出现的频率，从而实现字符串的重构。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接：https://leetcode.com/problems/reconstruct-original-digits-from-english/

Given a non-empty string containing an out-of-order English representation of digits 0-9, output the digits in ascending order.

Note:

Input contains only lowercase English letters.
Input is guaranteed to be valid and can be transformed to its original digits. That means invalid inputs such as "abc" or "zerone" are not permitted.
Input length is less than 50,000.

Example 1:

Input: "owoztneoer"

Output: "012"

Example 2:

Input: "fviefuro"

Output: "45"

class Solution{
public:
    string originalDigits(string s)
    {
        vector<int> bucket(26,0);
        vector<int> digits(10,0);
        for(auto digit:s)
            bucket[digit-'a']++;
        digits[0]=bucket['z'-97];
        digits[2]=bucket['w'-97];
        digits[4]=bucket['u'-97];
        digits[6]=bucket['x'-97];
        digits[8]=bucket['g'-97];

        digits[1]=bucket['o'-97]-digits[0]-digits[2]-digits[4];
        digits[3]=bucket['r'-97]-digits[0]-digits[4];
        digits[5]=bucket['f'-97]-digits[4];
        digits[7]=bucket['s'-97]-digits[6];
        digits[9]=(bucket['n'-97]-digits[1]-digits[7])/2;

        string result="";
        for(int i=0;i<digits.size();i++)
        {
            if(digits[i]!=0)
            {
                int j=digits[i];
                while(j>0)
                {
                    result+=to_string(i);
                    j--;
                }
            }
        }
        return result;
    }
};