Leetcode 288. Unique Word Abbreviation

方法： hashtable。

class ValidWordAbbr {
    private Set<String> set = new HashSet<>();
    private Map<String, Integer> map = new HashMap<>();
    public ValidWordAbbr(String[] dictionary) {
        for(String s : dictionary)
            set.add(s);
        for(String s : set){
            String key = transform(s);
            map.put(key, map.getOrDefault(key, 0) + 1);  
        }
    }
    
    public boolean isUnique(String word) {
        String transWord = transform(word);
        if(map.containsKey(transWord) && map.get(transWord) == 1 && set.contains(word)){
            return true;
        }else if(!map.containsKey(transWord)){
            return true;
        }else{
            return false;
        }
    }
    
    public String transform(String s){
        if(s.length() > 2){
            StringBuilder sb = new StringBuilder();
            sb.append(s.charAt(0));
            sb.append(s.length() - 2);
            sb.append(s.charAt(s.length() - 1));
            return sb.toString();
        }
        return s;
    }
}

/**
 * Your ValidWordAbbr object will be instantiated and called as such:
 * ValidWordAbbr obj = new ValidWordAbbr(dictionary);
 * boolean param_1 = obj.isUnique(word);
 */

总结：

• 无