lintcode,最长公共前缀

给k个字符串，求出他们的最长公共前缀(LCP)
样例
在 “ABCD” “ABEF” 和 “ACEF” 中, LCP 为 “A”
在 “ABCDEFG”, “ABCEFG”, “ABCEFA” 中, LCP 为 “ABC”

解题思路：先求两个字符串的commonprefix，然后保存结果和后面的字符串做common。
一刷ac

public class Solution {
    /**
     * @param strs: A list of strings
     * @return: The longest common prefix
     */
    public String longestCommonPrefix(String[] strs) {
        if(strs == null || strs.length == 0) return "";
        if(strs.length == 1) return strs[0];
        String res = commonprefix(strs[0],strs[1]);
        for(int i = 2; i < strs.length; i++){
            res = commonprefix(res, strs[i]);
        }

        return res;
    }
    public static String commonprefix(String s1, String s2){
        if(s1 == null || s1.length() == 0 || s2 == null || s2.length() == 0) return "";
        int i = 0;
        while(i < s1.length() && i < s2.length()){
            if(s1.charAt(i) == s2.charAt(i)) i++;
            else break;
        }
        String res = s1.substring(0,i);
        return res;
    }
}

改的干净点。

public class Solution {
    /**
     * @param strs: A list of strings
     * @return: The longest common prefix
     */
    public String longestCommonPrefix(String[] strs) {
        if(strs == null || strs.length == 0) return "";
        String prefix = strs[0];
        for(int i = 1; i < strs.length; i++){
            int idx = 0;
            while(idx < prefix.length() && idx < strs[i].length() && prefix.charAt(idx) == strs[i].charAt(idx)){
                idx++;
            }
            if(idx == 0) return "";
            prefix = prefix.substring(0,idx);
        }
        return prefix;
    }

}