
正文
LeetCode 14 Longest Common Prefix(最长公共前缀)
提示:扫一扫查出行【扫一扫了解最新限行尾号】
复制提示
题目链接:https://leetcode.com/problems/longest-common-prefix/?tab=Description
Problem: 找出给定的string数组中最长公共前缀
由于是找前缀,因此调用indexOf函数应当返回0(如果该字符子串为字符串的前缀时),如果不是则返回-1
Return:
the index of the first occurrence of the specified substring, or
-1 if there is no such occurrence.参考代码:
package leetcode_50;/***
*
* @author pengfei_zheng
* 最长公共前缀
*/
public class Solution14 {
public String longestCommonPrefix(String[] strs) {
if(strs == null || strs.length == ) return "";//字符串数组为空或者长度为0
String pre = strs[];
int i = ;
while(i < strs.length){//遍历所有字符串
while(strs[i].indexOf(pre) != )//当前子串不满足前缀
pre = pre.substring(,pre.length()-);//当前子串长度减一
i++;
}
return pre;//返回前缀
}
}






