refactor 288

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_288.java

@@ -6,37 +6,6 @@
 import java.util.Map;
 import java.util.Set;
 
-/**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
- */
 public class _288 {
     public static class Solution1 {