refactor 411

fishercoder1534 · fishercoder1534 · commit 7bf9ce3d9fae · 2020-07-07T06:44:35.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_411.java b/src/main/java/com/fishercoder/solutions/_411.java
@@ -3,34 +3,11 @@
 import java.util.ArrayList;
 import java.util.List;
 
-/**
- * 411. Minimum Unique Word Abbreviation
- *
- * A string such as "word" contains the following abbreviations:
-
- ["word", "1ord", "w1rd", "wo1d", "wor1", "2rd", "w2d", "wo2", "1o1d", "1or1", "w1r1", "1o2", "2r1", "3d", "w3", "4"]
-
- Given a target string and a set of strings in a dictionary,
- find an abbreviation of this target string with the smallest possible length such
- that it does not conflict with abbreviations of the strings in the dictionary.
-
- Each number or letter in the abbreviation is considered length = 1. For example, the abbreviation "a32bc" has length = 4.
-
- Note:
-
- In the case of multiple answers as shown in the second example below, you may return any one of them.
- Assume length of target string = m, and dictionary size = n. You may assume that m ≤ 21, n ≤ 1000, and log2(n) + m ≤ 20.
-
- Examples:
-
- "apple", ["blade"] -> "a4" (because "5" or "4e" conflicts with "blade")
-
- "apple", ["plain", "amber", "blade"] -> "1p3" (other valid answers include "ap3", "a3e", "2p2", "3le", "3l1").
- *
- */
 public class _411 {
     public static class Solution1 {
-        /** Credit: https://discuss.leetcode.com/topic/61346/trie-bruteforce */
+        /**
+         * Credit: https://discuss.leetcode.com/topic/61346/trie-bruteforce
+         */
         class Trie {
             Trie[] children = new Trie[26];
             boolean isWord = false;
@@ -114,7 +91,7 @@ public void abbrGenerator(String target, int i, String tmp, int abbr, int num) {
             }
             char cur = target.charAt(i);
             abbrGenerator(target, i + 1, abbr == 0 ? tmp + cur : tmp + abbr + cur, 0,
-                abbr == 0 ? num - 1 : num - 2);
+                    abbr == 0 ? num - 1 : num - 2);
             abbrGenerator(target, i + 1, tmp, abbr + 1, num);
         }
     }
