public class Solution {
    public String longestCommonPrefix(String[] strs) {
    	if(strs == null || strs.length == 0) return "";
    	
    	StringBuffer prefix = new StringBuffer();
    	char c;
    	for(int idx = 0; idx < strs[0].length(); idx++) {
    		c = strs[0].charAt(idx);
    		for(int j = 1; j < strs.length; j++) {
    			if(idx >= strs[j].length())	
    				return prefix.toString();
    			if(strs[j].charAt(idx) != strs[j-1].charAt(idx))
    				return prefix.toString();
    		}
    		prefix.append(c);
    	}
    	return prefix.toString();        
    }
}

@@ -359,55 +359,12 @@
 th()
-)%09%0A    %09%09%09%09return prefix.toString();%0A    %09%09%09if(
+ %7C%7C 
 strs
@@ -386,30 +386,11 @@
  != 
-strs%5Bj-1%5D.charAt(idx))
+c)%09
 %0A   

Update 014.java