【LeetCode】14. Longest Common Prefix

Problem Algorithmic thinking 方法一：水平扫描法 Java解法： public String longestCommonPrefix(String[] strs) { if (strs.length == 0) return ""; String prefix = strs[0]; for (int i = 1; i < strs.length;

>>阅读原文<<