Leetcode 527. Word Abbreviation

Problem:

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.

 

Solution:

　　这道题是要我们为输入字符串中的每个单词找到最短的缩写且不存在冲突，这里要注意下，比如intension和intrusion两个单词，i7n,in6n,int5n都存在两个单词与之对应，因此这题的缩写的含义是要找一个最短的缩写，使得不存在多个单词与之对应，所以这三种缩写形式都无法使用。这道题我们定义一个abbreviate函数，k代表缩写字符串中数字之前的字符个数，比如in6n对应的k等于2。pre数组用于存储前缀的长度信息，初始化为1。首先对于所有字符串先进行一个缩写，然后找出所有出现多次的字符串，增加其前缀的长度重新进行缩写，指到所有缩写都不存在冲突为止。

Code:

 

class Solution {
public:
    string abbreviate(string &str,int k){
        if(str.size()-2 <= k)
            return str;
        return str.substr(0,k)+to_string(str.size()-1-k)+str.back();
    }
    vector<string> wordsAbbreviation(vector<string>& dict) {
        int m = dict.size();
        vector<string> result(m);
        vector<int> pre(m,1);
        for(int i = 0;i != m;++i){
            result[i] = abbreviate(dict[i],pre[i]);
        }
        for(int i = 0;i != m;++i){
            while(true){
                unordered_set<int> us;
                for(int j = i+1;j != m;++j){
                    if(result[i] == result[j])
                        us.insert(j);
                }
                if(us.empty()) break;
                us.insert(i);
                for(auto index:us)
                    result[index] = abbreviate(dict[index],++pre[index]);
            }
        }
        return result;
    }
};