public class Solution {
public String longestCommonPrefix(String[] strs) {if (strs == null || strs.length == 0) {
return "";
}
int num = strs.length;
if (num == 1) {
return strs[0];
}
StringBuilder sb = new StringBuilder();
String baseString = strs[0];
for (int i = 0; i < baseString.length(); i++) {
char c = baseString.charAt(i);
int j = 1;
for (; j < num; j++) {
//不要阴沟翻船
//if ((i >= strs[j].length()) && (c != strs[j].charAt(i))) {if ((i >= strs[j].length()) || (c != strs[j].charAt(i))) {
return sb.toString();
}
}
if (j == num) {
sb.append(c);
}
}
return sb.toString();
}
}