题解 | 字符串排序
字符串排序
https://www.nowcoder.com/practice/5af18ba2eb45443aa91a11e848aa6723
#include <stdio.h>
#include<string.h>
#define Row 1000
#define Column 101
int compare(char* a, char* b, int start){
if(a[start] == '\0' && b[start] == '\0'){
return 0;
}
else if(a[start] > b[start] || b[start] == '\0'){
return 1;
}
else if(a[start] < b[start] || a[start] == '\0'){
return -1;
}
else{
return compare(a, b, start+1);
}
}
void change(char* a, char* b){
char tmp[Column];
strcpy(tmp, a);
strcpy(a, b);
strcpy(b, tmp);
}
int compare(char*, char*, int);
void change(char*, char*);
int main() {
int n;
char list[Row][Column];
scanf("%d", &n);
for(int i=0;i<n;i++){
scanf("%s", list[i]);
}
for(int i=0;i<n-1;i++){
for(int j=0;j<n-i-1;j++){
if(compare(list[j], list[j+1], 0) == 1){
change(list[j], list[j+1]);
}
}
}
for(int i=0;i<n;i++){
printf("%s\n", list[i]);
}
}
查看11道真题和解析