题目:https://leetcode-cn.com/problems/longest-common-prefix/
答案:
public String longestCommonPrefix(String[] strs) {
if(strs==null || strs.length == 0) return "";
if(strs.length==1) return strs[0];
Arrays.sort(strs, new Comparator<String>() {
@Override
public int compare(String o1, String o2) {
return o1.length()-o2.length();
}
});
if(strs[0].isEmpty()) return "";
char[] chars = strs[0].toCharArray();
String pre="";
for(int i=0;i<chars.length;i++){
pre +=chars[i];
boolean isExit = true;
for(int j=1;j<strs.length;j++){
if(!strs[j].startsWith(pre)){
isExit = false;
break;
}
}
if(!isExit){
pre = pre.substring(0,pre.length()-1);
break;
}
}
return pre;
}