LeetCode第14题:最长公共前缀
- 题目:编写一个函数来查找字符串数组中的最长公共前缀。
- 解法一:
class Solution {
public String longestCommonPrefix(String[] strs) {
String ans="";
if(strs.length==0) return ans;
int j;
for(int i=0;i<strs[0].length();i++){
char a=strs[0].charAt(i);
for(j=1;j<strs.length;){
if(strs[j].length()<=i || strs[j].charAt(i)!=a) return ans;
if(strs[j].charAt(i)==a){
j++;
}
}
ans=ans+a;
}
return ans;
}
}
- 解法二:先找前两个的最大前缀,在依次用求得的前缀与后面的字符串对比
public String longestCommonPrefix(String[] strs) {
if (strs.length == 0) return "";
String prefix = strs[0];
for (int i = 1; i < strs.length; i++)
while (strs[i].indexOf(prefix) != 0) {
prefix = prefix.substring(0, prefix.length() - 1);
if (prefix.isEmpty()) return "";
}
return prefix;
}
作者:LeetCode
链接:https://leetcode-cn.com/problems/longest-common-prefix/solution/zui-chang-gong-gong-qian-zhui-by-leetcode/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
- 解法三:分治。将数组平分为两个数组,分别求最长前缀,再将两个前缀进行对比。
public String longestCommonPrefix(String[] strs) {
if (strs == null || strs.length == 0) return "";
return longestCommonPrefix(strs, 0 , strs.length - 1);
}
private String longestCommonPrefix(String[] strs, int l, int r) {
if (l == r) {
return strs[l];
}
else {
int mid = (l + r)/2;
String lcpLeft = longestCommonPrefix(strs, l , mid);
String lcpRight = longestCommonPrefix(strs, mid + 1,r);
return commonPrefix(lcpLeft, lcpRight);
}
}
String commonPrefix(String left,String right) {
int min = Math.min(left.length(), right.length());
for (int i = 0; i < min; i++) {
if ( left.charAt(i) != right.charAt(i) )
return left.substring(0, i);
}
return left.substring(0, min);
}
作者:LeetCode
链接:https://leetcode-cn.com/problems/longest-common-prefix/solution/zui-chang-gong-gong-qian-zhui-by-leetcode/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。