O(n),比较简单,不进行分析.
char * longestCommonPrefix(char ** strs, int strsSize){
char *commomPrefix = malloc(500);
int idx=0;
while(strsSize>0){//这一个很奇怪的....
bool sameChar=true;
char common=strs[0][idx];
for(int i=0;i<strsSize;i++){
char c=strs[i][idx];
if(c=='\0'||common!=c){//遇到结尾或不同
sameChar=false;
break;
}
}
if(!sameChar||common=='\0'){
break;
}
commomPrefix[idx++]=common;
}
commomPrefix[idx]='\0';
return commomPrefix;
}