- 最长公共前缀
char * longestCommonPrefix(char ** strs, int strsSize){
if(1 == strsSize)
return strs[0];
int len1 = strsSize;//1.不能直接用strlen(strs)
int len2 = strlen(strs[0]);
int len = 0;
int i=0;
for(i=0;i<len1-1;i++){
len = 0;
int j = 0;
for(j=0;j<len2;j++){
if(strs[i][j]==strs[i+1][j])
len++;
else
break;
}
len2 = len;
}
char * s = (char*)malloc((len+1)*sizeof(char));//2.不能用数组char s[len+1],因为是静态存储无法返回指针
i = 0;
for(i=0;i<len;i++)
s[i]=strs[0][i];
s[len] = '\0';//3.字符串要记得结尾\0
return s;
// strs[0][len]='\0';
// return strs[0];
}