c语言，递归求解最大字符串

[cutdown3456]

请问这道题怎么做，做了好久了

[kuangbao9]

#include<stdio.h> #include<string> const char *strMax(const char *strArr[], int n) { const char *tmp = NULL; if (strcmp(strArr[n-1], strArr[n - 2]) == 1) { tmp = strArr[n-2]; strArr[n-2] = strArr[n-1]; strArr[n-1] = tmp; } if (n <= 2) { return strArr[0]; } strMax(strArr, n-1); } int main() { const char *strArr[] = { "BJilin","AJilin","HJilin","IJilin","IJilinU" }; const char *str_max = strMax(strArr, 6); printf("%s", str_max); getchar(); return 0; } 你试下这个

[kuangbao9]

const char *str_max = strMax(strArr, 6);改成const char *str_max = strMax(strArr, 5);

[寻开心]

char *strMax(const char *strArr[], int n) {
if ( n == 1 ) return strArr[0];
// 拿出最后一个字符串和递归的结果比较，返回大的
char * p = strMax(starArr, n-1);
if ( strcmp(p, strArr[n-1]) == 1 ) return p; else return strArr[n-1]);
}

[DayDayUp！]

我的只有一个用例不通过
#include<stdio.h>
#include<string.h>
char *StrMax(char *sa[],int n)
{
int m = 0;
char *fin;
if(m<n-1)
{
if(strcmp(sa[m],sa[m+1])>=0) fin = sa[m];
else fin = sa[m+1];
}
return fin;
}
int main()
{
int n,i,j;
scanf("%d",&n);
char sa[100][99];
for(j = 0;j<n;j++)
{
scanf("%s",sa[j]);
}
int m = 0;
char *fin;
while(m<n-1)
{
if(strcmp(sa[m],sa[m+1])>=0) fin = sa[m];
else fin = sa[m+1];
m++;
}
//return fin;
//char *fin = StrMax(,n);
printf("%s",fin);
return 0;
}