leetcode no14 - beyondnlp/nlp GitHub Wiki

char* longestCommonPrefix(char** strs, int strsSize) {

    int i, k=0, loop=1;
    char *str = NULL, *ret;
    if( strs == NULL ) return "";
    if( strsSize == 0 ) return "";
    if( strsSize == 1 ) return strs[0];

    str = strs[0];
    while(loop){
        for( i = 1; i < strsSize; i++ ){
            if( str[k] != strs[i][k] ){
                loop = 0;
                break;
            }
        }
        k++;
    }
    ret = malloc(sizeof(char)*k);
    memcpy( ret, strs[0], k-1 );
    ret[k-1]='\0';
    return ret;
}