编写一个函数来查找字符串数组中的最长公共前缀。
如果不存在公共前缀,返回空字符串 ""。
示例 1:
输入:strs = ["flower","flow","flight"]
输出:"fl"
示例 2:
输入:strs = ["dog","racecar","car"]
输出:""
解释:输入不存在公共前缀。
public String guanFang(String prefix, String str) {
int min = Math.min(prefix.length(), str.length());
int index = 0;
while (index < min && prefix.charAt(index) == str.charAt(index)) {
index++;
}
return prefix.substring(0, index);
}
public static void main(String[] args) {
String[] strS = {"flower", "flow", "flight"};
String[] S = {"dog","racecar","car"};
String prefix = longestCommonPrefix(S);
System.out.println(prefix);
}
public static String longestCommonPrefix(String[] strs) {
if(strs.length == 0 || strs == null) {
return "";
}
String prefix = strs[0];
for (int i = 1; i < strs.length; i++) {
prefix = gengXinPrefix(prefix, strs[i]);
}
return prefix;
}
private static String gengXinPrefix(String prefix, String str) {
int i = 0;
char[] pre = prefix.toCharArray();
char[] st = str.toCharArray();
while (true) {
if (i < pre.length && i < st.length) {
if (pre[i] == st[i]) {
i = i + 1;
} else {
break;
}
} else {
break;
}
}
if (i==0) {
return "";
}
return prefix.substring(0, i);
}