题解 | #最长公共前缀#
最长公共前缀
https://www.nowcoder.com/practice/28eb3175488f4434a4a6207f6f484f47
/**
* 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
*
*
* @param strs string字符串一维数组
* @param strsLen int strs数组长度
* @return string字符串
*/
char* longestCommonPrefix(char** strs, int strsLen ) {
// write code here
if (strsLen == 0)
return "";
char *initial = strs[0];
for (int i = 1; i < strsLen; i++)
{
if (initial[0] == strs[i][0])
{
for (int j = 1; initial[j] != '\0'; j++)
{
if (initial[j] != strs[i][j])
{
initial[j] = '\0';
}
}
}else {
return "";
}
}
return initial;
}
查看8道真题和解析
