【leetcode】最长公共前缀

 

char * longestCommonPrefix(char ** strs, int strsSize){
    int i,j,pst=0;
    char* str = (char*)calloc(1000,sizeof(char));
    if (strsSize==0) return str;
    for (i=0; ; i++)
    {
        for (j=0; j<strsSize; j++)
        {
            if (strs[j][i] != strs[0][i] || strs[j][i] == '\0') return str;
        }
        if (j==strsSize)
        {
            str[pst++] = strs[0][i];
        }
    }
    return str;
}