import java.util.*;
public class Solution {
/**
*
* @param strs string字符串一维数组
* @return string字符串
*/
public String longestCommonPrefix (String[] strs) {
// write code here
if(strs.length == 0){
return "";
}
int maxLength = 0;
for(int i = 0;i<strs[0].length();i++){
char temp = strs[0].charAt(i);
int j = 1;
for(;j<strs.length&&i<strs[j].length();j++){
if(strs[j].charAt(i) != temp){
break;
}
}
if(j == strs.length){
maxLength++;
}else{
break;
}
}
return strs[0].substring(0,maxLength);
}
}