Longest Common Prefix

最新推荐文章于 2024-02-18 12:25:05 发布

smallfish_yy

最新推荐文章于 2024-02-18 12:25:05 发布

阅读量387

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/smallfish_yy/article/details/18600459

LeetCode 专栏收录该内容

101 篇文章

订阅专栏

本文介绍了一种寻找字符串数组中最长公共前缀的方法。通过对比第一个和第二个字符串找到初步的公共前缀，然后迭代剩余字符串进一步缩小公共前缀范围。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Write a function to find the longest common prefix string amongst an array of strings.

Analysis: First compute the common prefix of the first two strings and then use the result compare with the rest of the strings in that array.

public class Solution {
    public String longestCommonPrefix(String[] strs) {
        String common = "";
        if(strs.length==0) return common;
        if(strs.length==1) return strs[0];
        
        // got common prefix from the first two strings
        String s0 = strs[0];
        String s1 = strs[1];
        for(int i=0; i<(s0.length()<=s1.length()?s0.length():s1.length()); i++) {
            if(s0.charAt(i)==s1.charAt(i)) common+=s0.charAt(i);
            else break;
        }
        if(common=="") return common;
        
        // iterate the rest strings in the array to got the longest common prefix
        for(int j=2; j<=strs.length-1; j++) {
            String temp = "";
            for(int k=0; k<(common.length()<=strs[j].length()?common.length():strs[j].length()); k++) {
                if(common.charAt(k) == strs[j].charAt(k)) {
                     temp += strs[j].charAt(k);
                }
                else {
                    if(k==0) return "";
                    else break;
                }
            }
            common = temp;
        }
        
        return common;
    }
}