@@ -0,0 +1,575 @@
+public class Solution %7B%0A    public String longestCommonPrefix(String%5B%5D strs) %7B%0A    %09if(strs == null %7C%7C strs.length == 0) return %22%22;%0A    %09%0A    %09StringBuffer prefix = new StringBuffer();%0A    %09char c;%0A    %09for(int idx = 0; idx %3C strs%5B0%5D.length(); idx++) %7B%0A    %09%09c = strs%5B0%5D.charAt(idx);%0A    %09%09for(int j = 1; j %3C strs.length; j++) %7B%0A    %09%09%09if(idx %3E= strs%5Bj%5D.length())%09%0A    %09%09%09%09return prefix.toString();%0A    %09%09%09if(strs%5Bj%5D.charAt(idx) != strs%5Bj-1%5D.charAt(idx))%0A    %09%09%09%09return prefix.toString();%0A    %09%09%7D%0A    %09%09prefix.append(c);%0A    %09%7D%0A    %09return prefix.toString();        %0A    %7D%0A%7D%0A

Create 014.java