14. Longest Common Prefix

题目：Write a function to find the longest common prefix string amongst an array of strings.

代码：

char* longestCommonPrefix(char** strs, int strsSize) {        int length=strlen(strs);    int i=0,j=-1;    int mark=-1;    if(strsSize==1)    {        return *strs;    }        if(strsSize==0)    {        //printf("The size is 0\n");        return "";    }    char com;    //printf("The length is %d %d\n",length,strsSize);    while(true)    {        j++; //第一次变为0        com=strs[0][j];                for(i=0;i<strsSize;i++)        {            if(strs[i][j]!='\0' && com==strs[i][j])            {                //printf("The com is i:%d, j:%d, com: %c, strs[i][j]: %c\n",i,j,com,strs[i][j]);                                continue;            }            else            {                mark=j;                break;            }        }        //printf("The mark is %d\n",mark);                if(mark==j )        {            break;        }    }                char *ret=(char *)malloc(sizeof(char)*mark);    for(i=0;i<mark;i++)    {        ret[i]=strs[0][i];    }    ret[i]='\0';        return ret;}