Write a function to find the longest common prefix string amongst an array of strings.
额,这个暴力点就成
额,这个暴力点就成
public String longestCommonPrefix(String[] strs) {
String result = "";
if(strs == null || strs.length==0){
return "";
}
int s = strs[0].length();
int len = strs.length;
int index= 0;
boolean temp = false;
for(int i = 0;i<len;i++){
if(strs[i].length()<s){
s = strs[i].length();
}
}
for(int i = 0 ;i<s;i++){
for(int j = 0;j<len-1 ;j++){
if(strs[j].charAt(i) != strs[j+1].charAt(i)){
temp = true;
break;
}
}
if(temp){
break;
}
index = i+1;
}
result = strs[0].substring(0, index);
return result;
}