mirror of
https://github.com/renbaoshuo/202401-programming-assignments.git
synced 2024-12-16 15:44:39 +00:00
54 lines
880 B
Markdown
54 lines
880 B
Markdown
# 6-4 计算最长的字符串长度
|
||
|
||
本题要求实现一个函数,用于计算有n个元素的指针数组s中最长的字符串的长度。
|
||
|
||
### 函数接口定义:
|
||
```c++
|
||
int max_len( char *s[], int n );
|
||
```
|
||
其中`n`个字符串存储在`s[]`中,函数`max_len`应返回其中最长字符串的长度。
|
||
|
||
### 裁判测试程序样例:
|
||
```c++
|
||
#include <stdio.h>
|
||
#include <string.h>
|
||
#include <stdlib.h>
|
||
|
||
#define MAXN 10
|
||
#define MAXS 20
|
||
|
||
int max_len( char *s[], int n );
|
||
|
||
int main()
|
||
{
|
||
int i, n;
|
||
char *string[MAXN] = {NULL};
|
||
|
||
scanf("%d", &n);
|
||
for(i = 0; i < n; i++) {
|
||
string[i] = (char *)malloc(sizeof(char)*MAXS);
|
||
scanf("%s", string[i]);
|
||
}
|
||
printf("%d\n", max_len(string, n));
|
||
|
||
return 0;
|
||
}
|
||
|
||
/* 你的代码将被嵌在这里 */
|
||
```
|
||
|
||
### 输入样例:
|
||
```in
|
||
4
|
||
blue
|
||
yellow
|
||
red
|
||
green
|
||
```
|
||
|
||
### 输出样例:
|
||
```out
|
||
6
|
||
|
||
```
|