62,614
社区成员
发帖
与我相关
我的任务
分享
public class Solution {
public String longestCommonPrefix(String[] strs) {
if(strs==null)
return "";
if(strs.length==1)
return "";
int min = Integer.MAX_VALUE;
StringBuilder stringBuilder =new StringBuilder();
for (int i = 0; i < strs.length; i++) {
if (strs[i].length() < min)
min = strs[i].length();
if(strs[i]==null)
return "";
}
if(min==0)
return "";
boolean flag = true;
for (int j = 0; j < min; j++) {
char tmp = strs[0].charAt(j);
for (int k = 0; k < strs.length; k++)
if (strs[k].charAt(j) != tmp) {
flag = false;
break;
}
if (flag)
stringBuilder.append(tmp);
else
return stringBuilder.toString();
}
return "";
}
}