refactor 748

fishercoder1534 · fishercoder1534 · commit b5980299950d · 2020-07-22T15:53:47.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_748.java b/src/main/java/com/fishercoder/solutions/_748.java
@@ -1,72 +1,41 @@
 package com.fishercoder.solutions;
 
-/**
- * 748. Shortest Completing Word
- *
- * Find the minimum length word from a given dictionary words,
- * which has all the letters from the string licensePlate. Such a word is said to complete the given string licensePlate
- *
- * Here, for letters we ignore case. For example, "P" on the licensePlate still matches "p" on the word.
- * It is guaranteed an answer exists. If there are multiple answers, return the one that occurs first in the array.
- * The license plate might have the same letter occurring multiple times. For example,
- * given a licensePlate of "PP", the word "pair" does not complete the licensePlate, but the word "supper" does.
-
- Example 1:
- Input: licensePlate = "1s3 PSt", words = ["step", "steps", "stripe", "stepple"]
- Output: "steps"
- Explanation: The smallest length word that contains the letters "S", "P", "S", and "T".
- Note that the answer is not "step", because the letter "s" must occur in the word twice.
- Also note that we ignored case for the purposes of comparing whether a letter exists in the word.
-
- Example 2:
- Input: licensePlate = "1s3 456", words = ["looks", "pest", "stew", "show"]
- Output: "pest"
- Explanation: There are 3 smallest length words that contains the letters "s".
- We return the one that occurred first.
-
- Note:
- licensePlate will be a string with length in range [1, 7].
- licensePlate will contain digits, spaces, or letters (uppercase or lowercase).
- words will have a length in the range [10, 1000].
- Every words[i] will consist of lowercase letters, and have length in range [1, 15].
-
- */
 public class _748 {
 
-  public static class Solution1 {
-    public String shortestCompletingWord(String licensePlate, String[] words) {
-      int[] counts = new int[26];
-      for (char c : licensePlate.toCharArray()) {
-        if (Character.isAlphabetic(c)) {
-          counts[Character.toLowerCase(c) - 'a']++;
+    public static class Solution1 {
+        public String shortestCompletingWord(String licensePlate, String[] words) {
+            int[] counts = new int[26];
+            for (char c : licensePlate.toCharArray()) {
+                if (Character.isAlphabetic(c)) {
+                    counts[Character.toLowerCase(c) - 'a']++;
+                }
+            }
+            String result = "";
+            for (String word : words) {
+                if (isComplete(word, counts)) {
+                    if (result.equals("")) {
+                        result = word;
+                    } else if (word.length() < result.length()) {
+                        result = word;
+                    }
+                }
+            }
+            return result;
         }
-      }
-      String result = "";
-      for (String word : words) {
-        if (isComplete(word, counts)) {
-          if (result.equals("")) {
-            result = word;
-          } else if (word.length() < result.length()) {
-            result = word;
-          }
-        }
-      }
-      return result;
-    }
 
-    private boolean isComplete(String word, int[] counts) {
-      int[] tmp = counts.clone();
-      for (char c : word.toCharArray()) {
-        if (tmp[c - 'a'] > 0) {
-          tmp[c - 'a']--;
-        }
-      }
-      for (int i : tmp) {
-        if (i != 0) {
-          return false;
+        private boolean isComplete(String word, int[] counts) {
+            int[] tmp = counts.clone();
+            for (char c : word.toCharArray()) {
+                if (tmp[c - 'a'] > 0) {
+                    tmp[c - 'a']--;
+                }
+            }
+            for (int i : tmp) {
+                if (i != 0) {
+                    return false;
+                }
+            }
+            return true;
         }
-      }
-      return true;
     }
-  }
 }
