|
发表于 2015-3-29 09:48:56
|
显示全部楼层
本帖最后由 haiouda 于 2015-3-30 10:42 编辑
- #include <stdio.h>
- #include <string.h>
- /* 本部分代码功能建议:函数原型声明 */
- /* User Code Begin(Limit: lines<=2, lineLen<=80, 考生可在本行后添加代码、最多2行、行长<=80字符) */
- int max=0;
- int input(char *from[],char p[50][9]);
- void find(char *from[],int n,int *findmax);
- /* User Code End(考生添加代码结束。注意:空行和单独为一行的{与}均不计行数、行长不计行首tab缩进) */
- int main(void)
- {
- char *pStr[50], str[50][9];
- int Count=0, max;
-
- printf("****Input strings****\n");
- Count = input(pStr, str);
-
- printf("\nmax = ");
- find(pStr, Count, &max);
- printf("%s\n", pStr[max]);
-
- return 0;
- }
- /* User Code Begin:考生在此后完成自定义函数的设计,行数不限 */
- int input(char *from[],char p[50][9])
- {
- int i,j=0;
- char *q="*END*";
-
-
- for(i=0;i<50;i++)
- {
- gets(p[i]);
-
- if( strcmp(p[i],q)==0 )
- break;
-
- else
- {
- from[j++] = *(p+i);
-
- }
-
-
-
- }
-
- return j;
- }
- void find(char *from[],int n,int *findmax)
- {
- char *temp1;
- int i,j;
- i=j=0;
-
-
- for(i=0;i+1<n;i++)
- {
- if(strcmp(from[i],from[i+1])<0)
-
- {
- temp1 = from[i+1];
- from[i+1]=from[i];
- from[i]=temp1;
- *findmax=i+1;
-
-
- }
-
-
- }
-
- printf("%d\n",*findmax);
-
-
- }
复制代码
改了下,可以运行了 |
|