武汉官网建设_东莞百度seo地址_什么是白帽seo_如何推销网站

暴力逐个比对最长前缀 

class Solution {public String longestCommonPrefix(String[] strs) {String prefix = strs[0];for (int i = 1; i < strs.length; i++) {prefix = longestCommonPrefix(prefix, strs[i]);}return prefix;}private String longestCommonPrefix(String str1, String str2) {int index = 0;int len = Math.min(str1.length(), str2.length());while (index < len) {if (str1.charAt(index) == str2.charAt(index)) {index++;}elsebreak;}return str1.substring(0, index);}
}