Practice-problems/reconstructOrginalDigits.js at master · jyliu17/Practice-problems · GitHub

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
/** Given a string s containing an out-of-order English representation of digits 0-9, return the digits in ascending order.


Example 1:

Input: s = "owoztneoer"
Output: "012"
Example 2:

Input: s = "fviefuro"
Output: "45"

**/

var originalDigits = function(s) {
    var count = Array(10);
    count.fill(0);
        for(var i = 0; i < s.length; i++) {
            var c = s[i];
            if (c == 'z') count[0]++;
            if (c == 'w') count[2]++;
            if (c == 'x') count[6]++;
            if (c == 's') count[7]++; //7-6
            if (c == 'g') count[8]++;
            if (c == 'u') count[4]++;
            if (c == 'f') count[5]++; //5-4
            if (c == 'h') count[3]++; //3-8
            if (c == 'i') count[9]++; //9-8-5-6
            if (c == 'o') count[1]++; //1-0-2-4
        }

        count[7] -= count[6];
        count[5] -= count[4];
        count[3] -= count[8];
        count[9] = count[9] - count[8] - count[5] - count[6];
        count[1] = count[1] - count[0] - count[2] - count[4];

        var sb = "";
        for(var i = 0; i <= 9; i++) {
            for(var j = 0; j < count[i]; j++) {
                sb+= i;
            }
        }
        return sb;
};