refactor 527

fishercoder1534 · fishercoder1534 · commit 2265d57f7cb5 · 2020-07-15T09:16:03.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_527.java b/src/main/java/com/fishercoder/solutions/_527.java
@@ -4,28 +4,6 @@
 import java.util.HashSet;
 import java.util.List;
 
-/**
- * 527. Word Abbreviation
- *
- * Given an array of n distinct non-empty strings, you need to generate minimal possible abbreviations for every word following rules below.
-
- Begin with the first character and then the number of characters abbreviated, which followed by the last character.
- If there are any conflict, that is more than one words share the same abbreviation,
- a longer prefix is used instead of only the first character until making the map
- from word to abbreviation become unique.
- In other words, a final abbreviation cannot map to more than one original words.
- If the abbreviation doesn't make the word shorter, then keep it as original.
-
- Example:
- Input: ["like", "god", "internal", "me", "internet", "interval", "intension", "face", "intrusion"]
- Output: ["l2e","god","internal","me","i6t","interval","inte4n","f2e","intr4n"]
-
- Note:
- Both n and the length of each word will not exceed 400.
- The length of each word is greater than 1.
- The words consist of lowercase English letters only.
- The return answers should be in the same order as the original array.
- */
 public class _527 {
 
     public static class Solution1 {
