LeetCode 14. 最长公共前缀

leetcode-cn.com/problems/lo…

思路：注意边界，两个遍历

public String longestCommonPrefix(String[] strs) {
    // 考虑边界
    if (strs == null || strs.length == 0 || strs[0] == null || strs[0].length() == 0) {
        return "";
    }
    String prefix = "";
    int len = strs[0].length();
    for (int i = 0; i < len; i++) {
        String nextPrefix = prefix + String.valueOf(strs[0].charAt(i));
        for (String str : strs) {
            if (!str.startsWith(nextPrefix)) {
                return prefix;
            }
        }
        prefix = nextPrefix;
    }
    return prefix;
}

文章永久链接：https://tech.souyunku.com/43449