Write a function to find the longest common prefix string amongst an array of strings.
public class Solution {
public String longestCommonPrefix(String[] strs) {
if(strs.length == 0) return "";
String prefix = strs[0];
for(int i=1; i<strs.length; i++)
{
for(int j=0; j< Math.min(strs[i].length(),prefix.length()); j++)
{
if(prefix.charAt(j) != strs[i].charAt(j))
{
if(j == 0) return "";
prefix = prefix.substring(0,j);
break;
}
}
if(strs[i].length() < prefix.length())
prefix = prefix.substring(0,strs[i].length());
}
return prefix;
}
}
注意处理string比prefix长度小的时候情况