题解 | #字符串排序#
字符串排序
https://www.nowcoder.com/practice/5af18ba2eb45443aa91a11e848aa6723
#include <stdio.h>
#include <stdlib.h>
int cmpfunc(const char** a, const char** b) {
return strcmp(*a, *b);
}
int main() {
int total;
scanf("%d", &total);
char* pstr = NULL;
char* strings[1000];
for (int i = 0; i < total; i++) {
pstr = (char*)malloc(sizeof(char) * 100);
scanf("%s", pstr);
strings[i] = pstr;
}
qsort(strings, total, sizeof(char*), cmpfunc);
for (int i = 0; i < total; i++) {
pstr = (char*)malloc(sizeof(char) * 100);
pstr=strings[i];
printf("%s\n",pstr);
}
return 0;
}