1. 題目

給定一個(gè)非空字符串，其中包含字母順序打亂的英文單詞表示的數(shù)字0-9。按升序輸出原始的數(shù)字。

注意:
輸入只包含小寫英文字母。
輸入保證合法并可以轉(zhuǎn)換為原始的數(shù)字，這意味著像 “abc” 或 “zerone” 的輸入是不允許的。
輸入字符串的長度小于 50,000。

示例 1: 輸入: "owoztneoer" 輸出: "012" (zeroonetwo)示例 2: 輸入: "fviefuro" 輸出: "45" (fourfive)

來源：力扣（LeetCode）
鏈接：https://leetcode-cn.com/problems/reconstruct-original-digits-from-english
著作權(quán)歸領(lǐng)扣網(wǎng)絡(luò)所有。商業(yè)轉(zhuǎn)載請聯(lián)系官方授權(quán)，非商業(yè)轉(zhuǎn)載請注明出處。

2. 解題

• 先找出只唯一擁有某字符的單詞
• Zero，tWo，foUr，siX，eiGht
• 然后上面找完了，再找剩下的唯一擁有字符的
• One，Three，Five，Seven
• 最后留下 nine

class Solution { public:string originalDigits(string s) {int count[26] = {0};for(auto& ch : s)count[ch-'a']++;int num[10] = {0};num[0] = count['z'-'a'];count['z'-'a'] -= num[0];count['e'-'a'] -= num[0];count['r'-'a'] -= num[0];count['o'-'a'] -= num[0];num[2] = count['w'-'a'];count['t'-'a'] -= num[2];count['w'-'a'] -= num[2];count['o'-'a'] -= num[2];num[4] = count['u'-'a'];count['f'-'a'] -= num[4];count['o'-'a'] -= num[4];count['u'-'a'] -= num[4];count['r'-'a'] -= num[4];num[6] = count['x'-'a'];count['s'-'a'] -= num[6];count['i'-'a'] -= num[6];count['x'-'a'] -= num[6];num[8] = count['g'-'a'];count['e'-'a'] -= num[8];count['i'-'a'] -= num[8];count['g'-'a'] -= num[8];count['h'-'a'] -= num[8];count['t'-'a'] -= num[8];num[1] = count['o'-'a'];count['o'-'a'] -= num[1];count['n'-'a'] -= num[1];count['e'-'a'] -= num[1];num[3] = count['t'-'a'];count['t'-'a'] -= num[3];count['h'-'a'] -= num[3];count['r'-'a'] -= num[3];count['e'-'a'] -= 2*num[3];num[5] = count['f'-'a'];count['f'-'a'] -= num[5];count['i'-'a'] -= num[5];count['v'-'a'] -= num[5];count['e'-'a'] -= num[5];num[7] = count['s'-'a'];count['s'-'a'] -= num[7];count['e'-'a'] -= 2*num[7];count['v'-'a'] -= num[7];count['n'-'a'] -= num[7];num[9] = count['i'-'a'];string ans;for(int i = 0; i < 10; ++i){while(num[i]--)ans += to_string(i);}return ans;} };

總結(jié)

以上是生活随笔為你收集整理的LeetCode 423. 从英文中重建数字（找规律）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。