package com.javalist;
import java.io.*;
public class leetcode14 {
public static String longestCommonPrefix(String[] strs) {
if (strs == null || strs.length == 0) {
return "";
}
String prefix = strs[0];
for (int i = 1; i < strs.length; ++i) {
while (!strs[i].startsWith(prefix)) {
prefix = prefix.substring(0, prefix.length() - 1);
if (prefix.isEmpty()) {
break;
}
}
}
return prefix;
}
public static void main(String[] args) {
String str1[]={"flower","flow"};
String s=longestCommonPrefix(str1);
System.out.println(s);
}
}
/**
public boolean startsWith(String prefix, int toffset)
public boolean startsWith(String prefix)
prefix -- 要匹配的前缀。
toffset -- 从哪里开始寻找字符串。
public String substring(int beginIndex)
public String substring(int beginIndex, int endIndex)
beginIndex -- 开始的索引(包含)
endIndex -- 结束的索引(不包含
*/
leetcode 代码
class Solution {
public String longestCommonPrefix(String[] strs) {
if (strs == null || strs.length == 0) {
return "";
}
String prefix = strs[0];
for (int i = 1; i < strs.length; ++i) {
while (!strs[i].startsWith(prefix)) {
prefix = prefix.substring(0, prefix.length() - 1);
if (prefix.isEmpty()) {
break;
}
}
}
return prefix;
}
}