14. Longest Common Prefix

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

Subscribe to see which companies asked this question

Show Tags
最长的相同前缀
public class Solution {
    public String longestCommonPrefix(String[] strs) {
        int n = strs.length;
        if(n==0)return "";
public class Solution {
public String longestCommonPrefix(String[] strs) {
int n = strs.length;
if (n == 0)
return "";
int minlen = strs[0].length();
for (int i = 1; i < n; i++) {
if (strs[i].length() < minlen)
minlen = strs[i].length();
}
char test = '0';
int last = minlen;
if (minlen == 0)
return "";
outer: for (int i = 0; i < minlen; i++) {
test = strs[0].charAt(i);


for (int j = 1; j < n; j++) {
if (test != strs[j].charAt(i)) {
last = i;
break outer;
}
}


}
return strs[0].substring(0, last);
}
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值