@@ -0,0 +1,595 @@
+// Write a function to find the longest common prefix string amongst an array of strings.%0A%0Apublic class Solution %7B%0A    public String longestCommonPrefix(String%5B%5D strs) %7B%0A    %09if(strs.length == 0) return %22%22;%0A%0A    %09String first= strs%5B0%5D;%0A    %09int end = first.length() == 0? 0 : first.length();%0A%0A    %09for(int i = 1; i %3C strs.length; i++)%7B%0A    %09%09String testString = strs%5Bi%5D;%0A    %09%09int j = 0;%0A%0A    %09%09while(j %3C first.length() && j %3C testString.length() && testString.charAt(j) == first.charAt(j))%7B%0A    %09%09%09j++;%0A    %09%09%7D%0A%0A    %09%09end = end %3C j? end : j;%0A    %09%7D%0A%0A    %09return first.substring(0, end);%0A    %7D%0A%7D

add longest common prefix solution