package leetcode;
public class demo_14 {
public String longestCommonPrefix(String[] strs) {
String s="";
int flag=1;
try {
for(int i=0;i<strs[0].length();i++) {
s=s+strs[0].charAt(i);
for(int j=1;j<strs.length;j++) {
//startsWith:检测字符串是否以指定的前缀开始
if(strs[j].startsWith(s)) {
continue;
}
else {
flag=0;
break;
}
}
if(flag==0) {
//s上一次是当前最长公共前缀
s=s.substring(0,s.length()-1);
break;
}
}
} catch (Exception e) {
// TODO: handle exception
}
System.out.println(s);
return s;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
demo_14 d14 =new demo_14();
String strs[]= {"flower","flow","flight"};
d14.longestCommonPrefix(strs);
}
}