Leetcode: 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"

# of '0': # of 'z'

# of '2': # of 'w'

4: u

6: x

8: g

3: h - 8

5: f - 4

7: s - 6

1: o - 0 - 2 - 4

9: i - 5 - 6 - 8

public String originalDigits(String s) {
    int[] count = new int[10];
    for (int i = 0; i < s.length(); i++){
        char c = s.charAt(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];
    StringBuilder sb = new StringBuilder();
    for (int i = 0; i <= 9; i++){
        for (int j = 0; j < count[i]; j++){
            sb.append(i);
        }
    }
    return sb.toString();
}

 

我的code用了一个数组来存char count

public class Solution {
    public String originalDigits(String s) {
        StringBuilder res = new StringBuilder();
        if (s==null || s.length()==0) return "";
        int[] chars = new int[26];
        int[] digits = new int[10];
        for (int i=0; i<s.length(); i++) {
            chars[s.charAt(i)-'a']++;
        }
        count(chars, digits);
        for (int i=0; i<digits.length; i++) {
            for (int j=0; j<digits[i]; j++) {
                res.append(i);
            }
        }
        return res.toString();
    } 
    
    public void count(int[] chars, int[] digits) {
        //'0'
        digits[0] = chars['z'-'a'];
        //'2'
        digits[2] = chars['w'-'a'];
        //'4'
        digits[4] = chars['u'-'a'];
        //'6'
        digits[6] = chars['x'-'a'];
        //'8'
        digits[8] = chars['g'-'a'];
        //'1' and '2' and '0' and '4' share 'o'
        digits[1] = chars['o'-'a'] - digits[2] - digits[0] - digits[4];
        //'3' and '8' share 'h'
        digits[3] = chars['h'-'a'] - digits[8];
        //'5' and '4' share 'f'
        digits[5] = chars['f'-'a'] - digits[4];
        //'7' and '6' share 's'
        digits[7] = chars['s'-'a'] - digits[6];
        //'9' and '5' and '6' and '8' share 'i'
        digits[9] = chars['i'-'a'] - digits[5] - digits[6] - digits[8];
    }
}