Leetcode Unique Word Abbreviation

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

Difficulty: Easy


Use two hashmaps to implement


public class ValidWordAbbr {
    HashMap<String, Integer> dict = new HashMap<String, Integer>();
    HashMap<String, Integer> abb = new HashMap<String, Integer>();
    public ValidWordAbbr(String[] dictionary) {
        for(String s : dictionary){
            dict.put(s, 1);
            if(s.length() >= 2){
                String ab = s.charAt(0) + String.valueOf(s.length() - 2) + s.charAt(s.length() - 1);
                if(!abb.containsKey(ab)){
                    abb.put(ab, 1);
                }
                else{
                    abb.put(ab, abb.get(ab) + 1);
                }
            }
        }
    }

    public boolean isUnique(String word) {
        if(word.length() == 0)
            return true;
        if(word.length() == 1)
            return true;
            String s  = word.charAt(0) + String.valueOf(word.length() - 2) + word.charAt(word.length() - 1);
        if(dict.containsKey(word) && abb.get(s) >= 2){
            return false;
        }
        if(dict.containsKey(word) && abb.get(s) == 1){
            return true;
        }
        if(abb.containsKey(s)){
            return false;
        }
        return true;
        
    }
}




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


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值