运用暴力法直接依次进行对比操作。
class Solution {
public String longestCommonPrefix(String[] strs) {
if (strs.length == 0||strs==null)
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);
}
return prefix;
}
}