Added task 14.

Author: javadev

Diff for: src/main/java/s0014.longest.common.prefix/Solution.java

@@ -0,0 +1,28 @@
+package s0014.longest.common.prefix;
+
+public class Solution {
+    public String longestCommonPrefix(String[] strs) {
+        if (strs.length < 1) return "";
+        if (strs.length == 1) return strs[0];
+
+        String temp = strs[0];
+
+        int i = 1;
+        String cur;
+
+        while (temp.length() > 0 && i < strs.length) {
+            if (temp.length() > strs[i].length()) {
+                temp = temp.substring(0, strs[i].length());
+            }
+
+            cur = strs[i].substring(0, temp.length());
+            if (!cur.equals(temp)) {
+                temp = temp.substring(0, temp.length() - 1);
+            } else {
+                i++;
+            }
+        }
+
+        return temp;
+    }
+}

Diff for: src/test/java/s0014.longest.common.prefix/SolutionTest.java

@@ -0,0 +1,15 @@
+package s0014.longest.common.prefix;
+
+import static org.hamcrest.CoreMatchers.equalTo;
+import static org.hamcrest.MatcherAssert.assertThat;
+
+import org.junit.Test;
+
+public class SolutionTest {
+    @Test
+    public void romanToInt() {
+        assertThat(
+                new Solution().longestCommonPrefix(new String[] {"flower", "flow", "flight"}),
+                equalTo("fl"));
+    }
+}