编写一个函数来查找字符串数组中的最长公共前缀。
如果不存在公共前缀,返回空字符串 ""
。
示例 1:
输入:strs = ["flower","flow","flight"] 输出:"fl"
示例 2:
输入:strs = ["dog","racecar","car"] 输出:"" 解释:输入不存在公共前缀。
提示:
0 <= strs.length <= 200
0 <= strs[i].length <= 200
strs[i]
仅由小写英文字母组成
import java.util.Stack;
public class Solution14 {
public String longestCommonPrefix(String[] strs) {
if (strs.length == 0) {
return "";
}
if (strs[0].equals("")) {
return "";
}
String t = "";
int l = 0;
// System.out.println("strs[i]:"+strs[i]);
for (int j = 1; j <= strs[0].length(); j++) {
int count = 0;
t = strs[0].substring(0, j);
// System.out.println("t:"+t);
for (int i = 0; i < strs.length; i++) {
// System.out.println(strs[i].substring(0, t.length()));
if (strs[i].length() >= t.length() && strs[i].substring(0, t.length()).equals(t)) {
count++;
// System.out.println("t:" + t);
// System.out.println("count:" + count);
// return t.substring(0, t.length() - 1);
}
if (count == strs.length) {
l++;
// System.out.println("l:"+l);
}
}
}
return strs[0].substring(0, l);
}
public static void main(String[] args) {
Solution14 s = new Solution14();
String[] strs = { "flower", "flower", "flower", "flower" };
System.out.println(s.longestCommonPrefix(strs));
}
}