14. Longest Common Prefix

最新推荐文章于 2022-03-20 08:23:53 发布

SHURamos

最新推荐文章于 2022-03-20 08:23:53 发布

阅读量208

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/SHURamos/article/details/52849675

版权

Leetcode 专栏收录该内容

220 篇文章 0 订阅

订阅专栏

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

My solution:

public class Solution {
    public String longestCommonPrefix(String[] strs) {
        StringBuilder out=new StringBuilder();
        if(strs.length==0)
            return out.toString();
        for(int i=0;i<strs[0].length();++i){
            char temp=strs[0].charAt(i);
            for(int j=1;j<strs.length;++j){
                if(i>=strs[j].length()||temp!=strs[j].charAt(i))
                    return out.toString();
                else
                    continue;
            }
            out.append(temp);
             }
        return out.toString();     
            
        
    }
}

Discuss:

public class Solution {
    public String longestCommonPrefix(String[] strs) {
        if(strs.length==0)
            return "";
        String pre=strs[0];
        for(int i=1;i<strs.length;++i){
            while(strs[i].indexOf(pre)!=0)
                pre=pre.substring(0,pre.length()-1);
            //if(pre.length()==0)
               // return pre;
            }
        return pre;    
        
    }
}

public class Solution {
    public String longestCommonPrefix(String[] strs) {
        if(strs.length==0)
            return "";
        StringBuilder out=new StringBuilder();
        Arrays.sort(strs);
        char[] a=strs[0].toCharArray();
        char[] b=strs[strs.length-1].toCharArray();
        for(int i=0;i<a.length;++i){
            if(i<b.length&&a[i]==b[i])
                out.append(a[i]);
            else
                return out.toString();
            }
        return out.toString();    
        
    }
}