C最长行算法

C最长行算法是一个用于在给定一组文本行时查找最长行的常见算法，可用于文本编辑器等应用程序中。以下是代码示例：

#include <stdio.h> #define MAXLINE 1000 /* maximum input line length */

int readline(char line[], int max); void copy(char to[], char from[]);

/* print longest input line / int main() { int len; / current line length / int max; / maximum length seen so far / char line[MAXLINE]; / current input line / char longest[MAXLINE]; / longest line saved here */

max = 0;
while ((len = readline(line, MAXLINE)) > 0)
    if (len > max) {
        max = len;
        copy(longest, line);
    }
if (max > 0) /* there was a line */
    printf("%s", longest);
return 0;

}

/* readline: read a line into s, return length */ int readline(char s[], int lim) { int c, i;

for (i = 0; i<lim-1 && (c = getchar())!=EOF && c!='\n'; ++i)
    s[i] = c;
if (c == '\n') {
    s[i] = c;
    ++i;
}
s[i] = '\0';
return i;

}

/* copy: copy 'from' into 'to'; assume to is big enough */ void copy(char to[], char from[]) { int i;

i = 0;
while ((to[i] = from[i]) != '\0')
    ++i;

}

该算法利用循环遍历输入的所有行，比较行的长度，然后将最长行保留在一个单独的字符串中。可以使用该算法来查找文档中的最长行并执行适当的操作。