[N-0] refactor 14

Author: fishercoder1534

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

@@ -1,43 +1,42 @@
 package com.fishercoder.solutions;
 
 /**
+ * 14. Longest Common Prefix
+ *
  * Write a function to find the longest common prefix string amongst an array of strings.
  */
 
 public class _14 {
 
-    public static String longestCommonPrefix(String[] strs) {
-        if (strs.length == 0) {
-            return "";
-        }
-
-        int i = 0;
-        String prefix = "";
-        String result = "";
-        boolean broken = false;
-        while (true) {
-            i++;
-            result = prefix;
-            if (i > strs[0].length()) {
-                break;//this will break out the while loop
+    public static class Solution1 {
+        public String longestCommonPrefix(String[] strs) {
+            if (strs.length == 0) {
+                return "";
             }
-            prefix = strs[0].substring(0, i);
-            for (String word : strs) {
-                if (i > word.length() || !word.startsWith(prefix)) {
-                    broken = true;
-                    break;//this will only break out of the for loop
+
+            int i = 0;
+            String prefix = "";
+            String result = "";
+            boolean broken = false;
+            while (true) {
+                i++;
+                result = prefix;
+                if (i > strs[0].length()) {
+                    break;//this will break out the while loop
+                }
+                prefix = strs[0].substring(0, i);
+                for (String word : strs) {
+                    if (i > word.length() || !word.startsWith(prefix)) {
+                        broken = true;
+                        break;//this will only break out of the for loop
+                    }
+                }
+                if (broken) {
+                    break;//this will break out the while loop
                 }
             }
-            if (broken) {
-                break;//this will break out the while loop
-            }
+            return result;
         }
-        return result;
     }
 
-    public static void main(String... strings) {
-//        String[] strs = new String[]{"a"};
-        String[] strs = new String[]{"a", "b"};
-        System.out.println(longestCommonPrefix(strs));
-    }
 }

src/test/java/com/fishercoder/_14Test.java

@@ -0,0 +1,24 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._14;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _14Test {
+    private static _14.Solution1 solution1;
+    private static String[] strs;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _14.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        strs = new String[]{"a", "b"};
+        assertEquals("", solution1.longestCommonPrefix(strs));
+    }
+
+}