Same Characters

Consider the following header file:

myheader.h

1. #ifndef _MYHEADER_H
2. #define _MYHEADER_H 1
4. int foo(char *);
6. #endif /* myheader.h */

Write the foo() function declared in myheader.h that takes the address of a string as a parameter. The function should determine and return the length of the longest substring of the same characters.

Note

Place the function in a file named foo.c and submit this file as a solution to the evaluation system. You can test your solution using the following files. The evaluation system does not necessarily perform the evaluation using these files.

main.c

1. #include <stdio.h>
2. #include <stdlib.h>
3. #include "myheader.h"
5. int main()
6. {
7.     char line[100];
8.     while (gets(line) != NULL)
9.         printf("%d\n", foo(line));
10.     return EXIT_SUCCESS;
11. }

Makefile

1. SRCS = main.c foo.c
2. OBJS = $(SRCS:%.c=%.o)
3. TARGETS = main
5. .PHONY: clean
7. all: $(TARGETS)
9. main: $(OBJS)
10. $(CC) $(OBJS) -o main
12. %.o: %.c
13. $(CC) -Wall -c $< -o $@
15. clean:
16. rm -rf $(OBJS) *~ $(TARGETS)

Sample Input

1. abcdefghijklmnopqrstuvwxyz
2. aabbccddeeffgghhiijjkkllmmnnooppqqrrssttuuvvwwxxyyzz
3. abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz
4. aaabcccdeeefggghiiijkkklmmmnooopqqqrssstuuuvwwwxyyyz
5. abbcccddddeeeeeffffffggggggghhhhhhhhiiiiiiiiijjjjjjjjjj
6. aaaaaaaaaabbbbbbbbbccccccccdddddddeeeeeefffffgggghhhiij
7. abbcccddddeeeeeffffffggggggghhhhhhiiiiijjjjkkkllm

Output for Sample Input

1. 1
2. 2
3. 1
4. 3
5. 10
6. 10
7. 7

One possible solution is available in: main.c.