Unique Word Abbreviation -- LeetCode

An abbreviation of a word follows the form <first letter><number><last letter>. Below are some examples of word abbreviations:

a) it                      --> it    (no abbreviation)

     1
b) d|o|g                   --> d1g

              1    1  1
     1---5----0----5--8
c) i|nternationalizatio|n  --> i18n

              1
     1---5----0
d) l|ocalizatio|n          --> l10n

Assume you have a dictionary and given a word, find whether its abbreviation is unique in the dictionary. A word's abbreviation is unique if no other word from the dictionary has the same abbreviation.

Example:

Given dictionary = [ "deer", "door", "cake", "card" ]

isUnique("dear") -> false
isUnique("cart") -> true
isUnique("cane") -> false
isUnique("make") -> true

Show Company Tags

Show Tags

Show Similar Problems

 

 class ValidWordAbbr {
 private:
     unordered_map<string, int> dict;
     unordered_set<string> inDict;
     string getAbbr(string word) {
         if (word.size() < ) return word;
         return word.front() + std::to_string(word.size() - ) + word.back();
     }
 public:
     ValidWordAbbr(vector<string> &dictionary) {
         for (int i = , n = dictionary.size(); i < n; i++) {
             if (inDict.count(dictionary[i])) continue;
             inDict.insert(dictionary[i]);
             string abbr = getAbbr(dictionary[i]);
             if (dict.count(abbr) == )
                 dict.insert(make_pair(abbr, ));
             else dict[abbr]++;
         }
     }

     bool isUnique(string word) {
         string abbr = getAbbr(word);
         if (dict.count(abbr) ==  || (dict[abbr] ==  && inDict.count(word) == ))
             return true;
         return false;
     }
 };

 // Your ValidWordAbbr object will be instantiated and called as such:
 // ValidWordAbbr vwa(dictionary);
 // vwa.isUnique("hello");
 // vwa.isUnique("anotherWord");

要点：int转string可以用函数std::to_string()

inDict 的作用有两个：1）将所给的字典去重。 2）判断要检测的单词是否在所给的字典中。