c 语言中在数组中查找字符串,在C中查找字符串数组中的唯一元素

您可以使用

qsort强制重复项彼此相邻.排序后,您只需要比较相邻的条目以查找重复项.结果是O(N log N)而不是(我认为)O(N ^ 2).

这是15分钟的午餐时间版本,没有错误检查：

typedef struct {

int origpos;

char *value;

} SORT;

int qcmp(const void *x, const void *y) {

int res = strcmp( ((SORT*)x)->value, ((SORT*)y)->value );

if ( res != 0 )

return res;

else

// they are equal - use original position as tie breaker

return ( ((SORT*)x)->origpos - ((SORT*)y)->origpos );

}

int main( int argc, char* argv[] )

{

SORT *sorted;

char **orig;

int i;

int num = argc - 1;

orig = malloc( sizeof( char* ) * ( num ));

sorted = malloc( sizeof( SORT ) * ( num ));

for ( i = 0; i < num; i++ ) {

orig[i] = argv[i + 1];

sorted[i].value = argv[i + 1];

sorted[i].origpos = i;

}

qsort( sorted, num, sizeof( SORT ), qcmp );

// remove the dups (sorting left relative position same for dups)

for ( i = 0; i < num - 1; i++ ) {

if ( !strcmp( sorted[i].value, sorted[i+1].value ))

// clear the duplicate entry however you see fit

orig[sorted[i+1].origpos] = NULL; // or free it if dynamic mem

}

// print them without dups in original order

for ( i = 0; i < num; i++ )

if ( orig[i] )

printf( "%s ", orig[i] );

free( orig );

free( sorted );

}