char s[100000];
int min(int a,int b){
return a < b ? a : b;
}
char* longestCommonPrefix(char** strs, int strsSize) {
int len = 10000,cnt = 0;
for(int i = 0;i < strsSize;i++) len = min(len,strlen(strs[i]));
for(int i = 0;i < len;i++){
int mark = 1;
for(int j = 1;j < strsSize;j++){
if(strs[j][i] != strs[0][i]){ mark = 0; break; }
}
if(mark) s[cnt++] = strs[0][i];
else break;
}
s[cnt] = 0;
return s;
}