Question

罗马废墟给定程序中,函数FUN的功能是;求SS所指字符串数组中长度最厂的字符串所在的行下标,作为函数值返回,

把其串长防在形参n所指变量中。SS所指字符串数组中共有M个字符串,且串长< N.

Answer 1

#include <stdio.h>
#define M 5
#define N 20
/**********************************found*********************************/
int fun(char (*ss) [___1___], int *n) N
{ int i, k=0, len=0;
for(i=0; i<M; i++)
{ len=strlen(ss[i]);
/**********************************found*********************************/
if(i==0) *n=___2___; len
if(len>*n) {
/**********************************found*********************************/
*n=____3____; len
k=i;
}
}
return(k);
}
main( )
{ char ss[M][N]={"shanghai","guangzhou","beijing","tianjing","cchongqing"};
int n,k,i;
printf("\nThe original strings are :\n");
for(i=0;i<M;i++)puts(ss[i]);
k=fun(ss,&n);
printf("\nThe length of longest string is : %d\n",n);
printf("\nThe longest string is : %s\n",ss[k]);
}

Answer 2

t;
#include <string.h>
#define M 5
#define N 20
void fun(char (*ss)[N])
{ int i, j, k=0, n, m, len;
for(i=0; i<M; i++)
{ len=strlen(ss[i]);
if(i==0) n=len;
if(len>n) {
/**********************************found*********************************/
n=len; k=___1___; i
}
}
for(i=0; i<M; i++)
if (i!=k)
{ m=n;
len=strlen(ss[i]);
/**********************************found*********************************/
for(j=___2___; j>=0; j--) len
ss[i][m--]=ss[i][j];
for(j=0; j<n-len; j++)
/**********************************found*********************************/
ss[i][j]=____3____; '*'
}
}
main( )
;
int i;
printf("\nThe original strings are :\n");
for(i=0; i<M; i++) printf("%s\n",ss[i]);
printf("\n");
fun(ss);
printf("\nThe result:\n");
for(i=0; i<M; i++) printf("%s\n",ss[i]);
}