class Solution {
public String longestCommonPrefix(String[] strs) {
if (strs.length0) {
return “”;
}
if (strs.length1) {
return strs[0];
}
String result = strs[0];
for (int i=0; i<strs.length; i++) {
while (!strs[i].startsWith(result)) {
result = result.substring(0,result.length()-1);
}
}
return result;
}
}