1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
|
class { public static String longestCommonPrefix(String[] strs) { if (strs.length == 0) return "";
for (int i = 0; i < strs[0].length(); i++) { for (int j = 1; j < strs.length; j++) { if (strs[j].length() == i || strs[0].charAt(i) != strs[j].charAt(i)) { return strs[0].substring(0, i); } } } return strs[0]; } }
|
近期评论