edit 14

fishercoder1534 · fishercoder1534 · commit 762ab25d7ab6 · 2017-06-14T06:41:17.000-07:00
diff --git a/README.md b/README.md
@@ -507,7 +507,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |17|[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/LetterCombinationsofaPhoneNumber.java)|O(n*4^n)|O(n)|Medium|Backtracking
 |16|[3Sum Closest](https://leetcode.com/problems/3sum-closest/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_16.java)|O(nlogn)|O(1)|Medium|Two Pointers
 |15|[3Sum](https://leetcode.com/problems/3sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_15.java)|O(n^2)|O(1)|Medium|Two Pointers
-|14|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/LongestCommonPrefix.java)| O(n*min(wordLength in this array)) | O(1) | Easy
+|14|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_14.java)| O(n*min(wordLength in this array)) | O(1) | Easy
 |13|[Roman to Integer](https://leetcode.com/problems/roman-to-integer)|[Solution](../master/src/main/java/com/fishercoder/solutions/_13.java)| O(1) | O(1) | Easy
 |12|[Integer to Roman](https://leetcode.com/problems/integer-to-roman/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_12.java)|O(1)|O(1)|Medium|
 |11|[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_11.java)|O(n)|O(1)|Medium|
diff --git a/src/main/java/com/fishercoder/solutions/_14.java b/src/main/java/com/fishercoder/solutions/_14.java
@@ -1,6 +1,6 @@
 package com.fishercoder.solutions;
 /**Write a function to find the longest common prefix string amongst an array of strings.*/
-public class LongestCommonPrefix {
+public class _14 {
 
     public static String longestCommonPrefix(String[] strs) {
         if(strs.length == 0) return "";
