class Solution {
public String longestCommonPrefix(String[] strs) {
if(strs.length == 0){
return "";
}
String str = strs[0];
for(int i = 1; i<strs.length; i++){
int j = 0;
for(; j<str.length()&&j<strs[i].length(); j++){
if(str.charAt(j)!=strs[i].charAt(j)){break;}
}
str = str.substring(0,j);
}
return str;
}
}