LeetCode 14. Longest Common Prefix

佚名 7年前 (2018-10-13) 算法 2317人围观抢沙发百度已收录

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

If there is no common prefix, return an empty string "".

SRE实战互联网时代守护先锋，助力企业售后服务体系运筹帷幄！一键直达领取阿里云限量特价优惠。

Example 1:

Input: ["flower","flow","flight"]

Output: "fl"

Example 2:

Input: ["dog","racecar","car"]

Output: ""

Explanation: There is no common prefix among the input strings.

Note:

All given inputs are in lowercase letters a-z.

package LeetCode;

public class L14_LongestCommonPrefix {
    public String longestCommonPrefix(String[] strs) {
        StringBuilder prefix=new StringBuilder();
        if(strs.length==0)
            return "";
        boolean flag=true;//当前循环是否有共同字母
        for(int i=0;i<strs[0].length();i++)
        {
            for(int j=1;j<strs.length;j++){//其他字符串当前位置字符是否与第一行字符串当前位置字符一致
                if(strs[j].length()<i+1){
                    flag=false;
                    //prefix.charAt(prefix.length()-1);//移除最后一个字符
                    break;
                }else if(strs[j].charAt(i)!=strs[0].charAt(i)){
                    flag=false;
                    break;
                }else
                    continue;
            }
            if(!flag)
                break;
            prefix.append(strs[0].charAt(i));
        }
        return  prefix.toString();
    }
}