Unique Word Abbreviation Solutions in C++

/// Source : https://leetcode.com/problems/unique-word-abbreviation/
/// Author : liuyubobobo
/// Time   : 2018-08-13

#include <iostream>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <cassert>
#include <stdexcept>

using namespace std;

/// Brute Force
/// Iterate all words in dictionary to see isUnique
/// Time Complexity: init : O(n)
///                         isUnique : O(n)
/// Space Complexity: O(n)
class ValidWordAbbr {

private:
    unordered_set<string> words;

public:
    ValidWordAbbr(vector<string> dictionary):
            words(dictionary.begin(), dictionary.end()) {}

    bool isUnique(string word) {

        for(const string& e: words){
            if(e == word)
                continue;

            int l = e.size();
            if(l == word.size() && e[0] == word[0] && e[l - 1] == word[l - 1])
                return false;
        }
        return true;
    }
};


void print_bool(bool res){
    cout << (res ? "True" : "False") << endl;
}

int main() {

    vector<string> dictionary;
    dictionary.push_back("deer");
    dictionary.push_back("door");
    dictionary.push_back("cake");
    dictionary.push_back("card");
    dictionary.push_back("hello");

    ValidWordAbbr vwa(dictionary);

    print_bool(vwa.isUnique("dear"));
    print_bool(vwa.isUnique("cart"));
    print_bool(vwa.isUnique("cane"));
    print_bool(vwa.isUnique("make"));
    print_bool(vwa.isUnique("hello"));

    return 0;
}

/// Source : https://leetcode.com/problems/unique-word-abbreviation/
/// Author : liuyubobobo
/// Time   : 2016-12-03

#include <iostream>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <cassert>
#include <stdexcept>

using namespace std;

/// Using HashMap
/// The tricky part here is that we need another set to store all the different words.
/// For function isUnique, we need to see:
///     - The dictionary doesn't contain the word, then it's unique
///     - The dictionary contains exactly the same word,
///       and no aother word's abbreviation is the same, then it's unique (tricky)
///     - The dictionary contains other words have the same abbreviation,
///       then it's not unique.
///
/// Time Complexity:
///     If there are n words and the longest word contains slen character, then
///     the building time : O(n*slen)
///     isUnique : O(slen)
/// Space Complexity: O(n)
class ValidWordAbbr {

private:
    unordered_set<string> words;
    unordered_map<string, int> abbr_words;

    string abbr(const string &word){

        //assert( word.size() >= 2 );

        // According to the test cases,
        // If a word's length is less than 2,
        // Then the abbreviation is itself.
        if(word.size() <= 2)
            return word;

        int num = word.substr(1, word.size() - 2).size();
        return word[0] + to_string(num) + word[word.size()-1];
    }

public:
    ValidWordAbbr(vector<string> dictionary) {
        for(const string& word: dictionary)
            if(words.find(word) == words.end()){
                words.insert(word);
                abbr_words[abbr(dictionary[i])] += 1;
            }
    }

    bool isUnique(string word) {
        if(words.find(word) == words.end())
            return abbr_words[abbr(word)] == 0;

        return abbr_words[abbr(word)] == 1;
    }

    void show(){

        cout << "words :" << endl;
        for(unordered_set<string>::iterator iter = words.begin() ; iter != words.end() ; iter ++ )
            cout << "  " << *iter << endl;

        cout << "abbr_words :" << endl;
        for(unordered_map<string,int>::iterator iter = abbr_words.begin() ; iter != abbr_words.end() ; iter ++ )
            cout << "  ( " << iter->first << " , " << iter->second << " )"<<endl;

        cout << endl;
    }
};


void print_bool(bool res){
    cout << (res ? "True" : "False") << endl;
}

int main() {

    vector<string> dictionary;
    dictionary.push_back("deer");
    dictionary.push_back("door");
    dictionary.push_back("cake");
    dictionary.push_back("card");
    dictionary.push_back("hello");

    ValidWordAbbr vwa(dictionary);
    vwa.show();

    print_bool(vwa.isUnique("dear"));
    print_bool(vwa.isUnique("cart"));
    print_bool(vwa.isUnique("cane"));
    print_bool(vwa.isUnique("make"));
    print_bool(vwa.isUnique("hello"));

    return 0;
}