blob: 137bb11b3818f902f3588a611256b343bf4415af (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
#include <stdio.h>
/* The C Programming Language: 2nd Edition
*
* Exercise 1-16: Revise the main routine of the longest-line program so it
* will correctly print the length of arbitrarily long input lines, and as
* much as possible of the text.
*
* Answer: The key to arbitrary limits is buffering. Using a buffer allows you
* to tackle a problem in chunks of memory instead of all at once. It's
* slightly more complicated, but adds usefulness to a program.
*/
#define MAXLENGTH 100
int get_line(char s[], int lim) {
/* Put as much as possible into a temp string, and count its length */
int c, i;
for (i = 0; i < lim && (c = getchar()) != EOF && c != '\n'; ++i) {
s[i] = c;
}
if (c == '\n') {
s[i] = c;
++i;
}
s[i] = '\0';
return i;
}
void copy(char from[], char to[]) {
int i = 0;
while ((to[i] = from[i]) != '\0') {
++i;
}
}
int main() {
int len, max;
char line[MAXLENGTH];
char longest[MAXLENGTH];
max = 0;
while ((len = get_line(line, MAXLENGTH)) > 0) {
if (len > max) {
max = len;
copy(line, longest);
}
}
printf("\nThe longest line is %3d characters long.\n", max);
printf("----------------------------------------\n");
if (max > 0) {
printf("%-s", longest);
if (max == MAXLENGTH && longest[max - 1] != '\n') {
printf("\n");
}
}
return 0;
}
|
