refactor 243

fishercoder1534 · fishercoder1534 · commit 317bab43495b · 2018-10-18T07:40:06.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_243.java b/src/main/java/com/fishercoder/solutions/_243.java
@@ -1,6 +1,9 @@
 package com.fishercoder.solutions;
 
-/**Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list.
+/**
+ * 243. Shortest Word Distance
+ *
+ * Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list.
 
  For example,
  Assume that words = ["practice", "makes", "perfect", "coding", "makes"].
@@ -11,25 +14,24 @@
  Note:
  You may assume that word1 does not equal to word2, and word1 and word2 are both in the list.*/
 public class _243 {
-
-    public int shortestDistance(String[] words, String word1, String word2) {
-
-        int p = -1;
-        int q = -1;
-        int min = Integer.MAX_VALUE;
-        for (int i = 0; i < words.length; i++) {
-            if (words[i].equals(word1)) {
-                p = i;
-            }
-            if (words[i].equals(word2)) {
-                q = i;
-            }
-            if (p != -1 && q != -1) {
-                min = Math.min(min, Math.abs(p - q));
+    public static class Solution1 {
+        public int shortestDistance(String[] words, String word1, String word2) {
+            int p = -1;
+            int q = -1;
+            int min = Integer.MAX_VALUE;
+            for (int i = 0; i < words.length; i++) {
+                if (words[i].equals(word1)) {
+                    p = i;
+                }
+                if (words[i].equals(word2)) {
+                    q = i;
+                }
+                if (p != -1 && q != -1) {
+                    min = Math.min(min, Math.abs(p - q));
+                }
             }
-        }
-        return min;
+            return min;
 
+        }
     }
-
 }
