Longest Common Prefix

来源：互联网发布：星光大道网络赛区编辑：程序博客网时间：2024/06/15 20:25

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

char* longestCommonPrefix(char** strs, int strsSize) {      if(strsSize<1)        return("");    if(strsSize==1)        return(strs[0]);    int n =strlen(*(strs)) ;    int i ,j ;    char tar;    char *ret ;    for( i = 1 ; i < strsSize ; i++)        n = n < strlen(*(strs+i))?n:strlen(*(strs+i));        ret = malloc(n*sizeof(char)+1);           *ret='\0'; for(j=0 ; j <n ; j++)        {            tar =strs[0][j];            for(i=0 ; i <strsSize ; i++)                if(tar != strs[i][j])                    {                         for(i = 0 ; i< j ; i++)                        ret[i]=strs[0][i];                         ret[i]='\0';                        return(ret);                    }        }        for(i = 0 ; i< j ; i++)            ret[i]=strs[0][i];            ret[i]='\0';        return(ret);}

0 0