LeetCode Word Abbreviation

原题链接在这里：https://leetcode.com/problems/word-abbreviation/description/

题目：

Given an array of n distinct non-empty strings, you need to generate minimal possible abbreviations for every word following rules below.

1. Begin with the first character and then the number of characters abbreviated, which followed by the last character.
2. If there are any conflict, that is more than one words share the same abbreviation, a longer prefix is used instead of only the first character until making the map from word to abbreviation become unique. In other words, a final abbreviation cannot map to more than one original words.
3. If the abbreviation doesn't make the word shorter, then keep it as original.

Example:

Input: ["like", "god", "internal", "me", "internet", "interval", "intension", "face", "intrusion"]
Output: ["l2e","god","internal","me","i6t","interval","inte4n","f2e","intr4n"]

Note:

1. Both n and the length of each word will not exceed 400.
2. The length of each word is greater than 1.
3. The words consist of lowercase English letters only.
4. The return answers should be in the same order as the original array.

题解：

暴力解法把字典里所有的string都最短缩写，遇到重复的就都加个prefix再检查.

Time Complexity: O(mn). m = dict.size(). n是字典里string的平均长度.

Space: O(m).

AC Java:

 class Solution {
     public List<String> wordsAbbreviation(List<String> dict) {
         int len = dict.size();
         String [] res = new String[len];
         int [] prefix = new int[len];
 
         for(int i = 0; i<len; i++){
             String abbr = getAbbr(dict.get(i), 0);
             res[i] = abbr;
         }
 
         for(int i = 0; i<len; i++){
             while(true){
                 HashSet<Integer> hs = new HashSet<Integer>();
                 for(int j = i+1; j<len; j++){
                     if(res[j].equals(res[i])){
                         hs.add(j);
                     }
                 }
 
                 if(hs.isEmpty()){
                     break;
                 }
 
                 hs.add(i);
                 for(int duplicateInd : hs){
                     res[duplicateInd] = getAbbr(dict.get(duplicateInd), ++prefix[duplicateInd]);
                 }
             }
         }
 
         return Arrays.asList(res);
     }
 
     private String getAbbr(String s, int ind){
         int len = s.length();
         if(len-ind <= 3){
             return s;
         }
 
         return s.substring(0, ind+1) + (len-ind-2) + s.charAt(len-1);
     }
 }

类似Valid Word Abbreviation.