-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path423.reconstruct-original-digits-from-english.java
59 lines (47 loc) · 1.5 KB
/
423.reconstruct-original-digits-from-english.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
class Solution {
public String originalDigits(String s) {
int[] mapr = new int[26];
int sz = s.length();
for(int i=0;i<s.length();i++)
mapr[s.charAt(i)-'a']++;
String[] digits = new String[]{"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"};
StringBuilder res = new StringBuilder();
int[] sort = new int[10];
for(int i=0;i<s.length();i++){
if(s.charAt(i) == 'z')
sort[0]++;
if(s.charAt(i) == 'w')
sort[2]++;
if(s.charAt(i) == 'g')
sort[8]++;
if(s.charAt(i) == 'x')
sort[6]++;
if(s.charAt(i) == 'v')
sort[5]++;
if(s.charAt(i) == 'o')
sort[1]++;
if(s.charAt(i) == 's')
sort[7]++;
if(s.charAt(i) == 'f')
sort[4]++;
if(s.charAt(i) == 'h')
sort[3]++;
if(s.charAt(i) == 'i')
sort[9]++;
}
sort[7] -= sort[6];
sort[5] -= sort[7];
sort[4] -= sort[5];
sort[1] -= (sort[2]+sort[4]+sort[0]);
sort[3] -= sort[8];
sort[9] -= (sort[5]+sort[6]+sort[8]);
for(int i=0;i<10;i++)
{
while(sort[i] > 0){
res.append(i);
sort[i]--;
}
}
return res.toString();
}
}