beats 67%
public class Solution {
public String longestCommonPrefix(String[] strs) {
int len=strs.length;
int endIndex=-1;
int i=0;
boolean flag=true;
if(len==0)
return "";
while(flag){
char keyChar;
endIndex=i;
if(i<strs[0].length())
keyChar=strs[0].charAt(i);
else{
flag=false;
break;
}
for(int j=1;j<len;j++){
char curChar;
if(i<strs[j].length())
curChar=strs[j].charAt(i);
else{
flag=false;
break;
}
if(curChar!=keyChar){
flag=false;
break;
}
}
i++;
}
return strs[0].substring(0, endIndex);
}
}