char * originalDigits(char * s){
int arr[26], i, j, cnt=0, num[10];
int index = 0;
memset(arr, 0, sizeof(arr));
memset(num, 0, sizeof(num));
for(i=0; s[i]; i++){
arr[s[i]-'a']++;
}
while(arr['z'-'a'] > 0) {
arr['z'-'a']--;
arr['e'-'a']--;
arr['r'-'a']--;
arr['o'-'a']--;
num[0]++;
}
while(arr['x'-'a']> 0){
arr['x'-'a']--;
arr['s'-'a']--;
arr['i'-'a']--;
num[6]++;
}
while(arr['g'-'a']> 0){
arr['e'-'a']--;
arr['i'-'a']--;
arr['g'-'a']--;
arr['h'-'a']--;
arr['t'-'a']--;
num[8]++;
}
while(arr['h'-'a'] > 0) {
arr['t'-'a']--;
arr['h'-'a']--;
arr['r'-'a']--;
arr['e'-'a']--;
arr['e'-'a']--;
num[3]++;
}
while(arr['u'-'a'] > 0) {
arr['f'-'a']--;
arr['o'-'a']--;
arr['u'-'a']--;
arr['r'-'a']--;
num[4]++;
}
while(arr['f'-'a'] > 0){
arr['f'-'a']--;
arr['i'-'a']--;
arr['v'-'a']--;
arr['e'-'a']--;
num[5]++;
}
while(arr['w'-'a']> 0 ){
arr['t'-'a']--;
arr['w'-'a']--;
arr['o'-'a']--;
num[2]++;
}
while(arr['i'-'a']> 0){
arr['n'-'a']--;
arr['i'-'a']--;
arr['n'-'a']--;
arr['e'-'a']--;
num[9]++;
}
while(arr['o'-'a'] > 0){
arr['o'-'a']--;
arr['n'-'a']--;
arr['e'-'a']--;
num[1]++;
}
while(arr['s' - 'a']) {
arr['s' - 'a']--;
num[7]++;
}
for(i=0; i<10; i++){
while(num[i]){
num[i]--;
s[index++] = i + '0';
}
}
s[index] = 0;
return s;
}
leetcode423. 从英文中重建数字-C语言
最新推荐文章于 2024-04-19 21:00:57 发布