public class Solution {
public String longestCommonPrefix(String[] strs) {
if (strs == null) return "";
if (strs.length == 0) return "";
String prefix = strs[0];
if (prefix==null) return "";
for (int i=1; i<strs.length; i++){
if (strs[i] == null) return "";
if (prefix.length()==0 || strs[i].length()==0)
return "";
int len = prefix.length()<strs[i].length()?prefix.length():strs[i].length();
int j;
for (j=0; j<len; j++){
if (prefix.charAt(j)!=strs[i].charAt(j))
break;
}
prefix = prefix.substring(0, j);
}
return prefix;
}
}
Longest Common Prefix
最新推荐文章于 2019-10-10 16:21:37 发布