import java.util.*;
public class Solution {
/**
*
* @param strs string字符串一维数组
* @return string字符串
*/
public String longestCommonPrefix (String[] strs) {
// write code here
if (strs == null || strs.length == 0) {
return "";
}
if (strs.length == 1) {
return strs[0];
}
String first = strs[0];
StringBuilder sb = new StringBuilder();
for (int i = 0; i < first.length(); i++) {
for (int j = 1; j < strs.length; j++) {
if (strs[j].length() < (i+1) || strs[j].charAt(i) != first.charAt(i)) {
return sb.toString();
}
}
sb.append(first.charAt(i));
}
return sb.toString();
}
}