lintcode-medium-Longest Common Prefix

最新推荐文章于 2025-06-29 18:14:49 发布

转载最新推荐文章于 2025-06-29 18:14:49 发布 · 76 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/goblinengineer/p/5321819.html

本文介绍了一个算法，用于在给定的字符串集合中找到最长公共前缀。通过实例演示了如何处理不同长度的字符串集合，并提供了一个Java代码实现。

Given k strings, find the longest common prefix (LCP).

For strings "ABCD", "ABEF" and "ACEF", the LCP is "A"

For strings "ABCDEFG", "ABCEFG" and "ABCEFA", the LCP is "ABC"

public class Solution {
    /**
     * @param strs: A list of strings
     * @return: The longest common prefix
     */
    public String longestCommonPrefix(String[] strs) {
        // write your code here
        
        if(strs == null || strs.length == 0)
            return "";
        
        if(strs.length == 1)
            return strs[0];
        
        int min = Integer.MAX_VALUE;
        
        for(int i = 0; i < strs.length; i++)
            if(strs[i].length() < min)
                min = strs[i].length();
        
        StringBuilder result = new StringBuilder();
            
        for(int i = 0; i < min; i++){
            char c = strs[0].charAt(i);
            
            for(int j = 1; j < strs.length; j++){
                if(strs[j].charAt(i) != c)
                    return result.toString();
            }
            
            result.append(c);
        }
        
        return result.toString();
    }
}

转载于:https://www.cnblogs.com/goblinengineer/p/5321819.html