怎么看网站用哪个系统做的/专业做网站的公司

實際上我試圖解決我認為你在設計的"難題"。 下面的代碼查找在file1和file2中找到的最長字元串。 如果有多個"最長"字元串，則只報告找到的第一個字元串。 可能會對某人有所幫助，在某些情況下，( 雖然你在這裡找的解決方案可能不是):#include

#include

#include

#include

#include

/* This routine returns the size of the file it is called with. */

static unsigned

get_file_size (const char * file_name)

{

struct stat sb;

if (stat (file_name, & sb)!= 0) {

fprintf (stderr,"'stat' failed for '%s': %s.n",

file_name, strerror (errno));

exit (EXIT_FAILURE);

}

return sb.st_size;

}

/* This routine reads the entire file into memory. */

static unsigned char *

read_whole_file (const char * file_name)

{

unsigned s;

unsigned char * contents;

FILE * f;

size_t bytes_read;

int status;

s = get_file_size (file_name);

contents = malloc (s + 1);

if (! contents) {

fprintf (stderr,"Not enough memory.n");

exit (EXIT_FAILURE);

}

f = fopen (file_name,"r");

if (! f) {

fprintf (stderr,"Could not open '%s': %s.n", file_name,

strerror (errno));

exit (EXIT_FAILURE);

}

bytes_read = fread (contents, sizeof (unsigned char), s, f);

if (bytes_read!= s) {

fprintf (stderr,"Short read of '%s': expected %d bytes"

"but got %d: %s.n", file_name, s, bytes_read,

strerror (errno));

exit (EXIT_FAILURE);

}

status = fclose (f);

if (status!= 0) {

fprintf (stderr,"Error closing '%s': %s.n", file_name,

strerror (errno));

exit (EXIT_FAILURE);

}

return contents;

}

int main(int argc, char* argv[]){

int i1, i2, l1, l2, lm;

unsigned char longestString[1000];//lazy way to make big enough.

unsigned char tempString[1000];

int longestFound=0;

unsigned char *f1, *f2;//buffers with entire file contents

f1 = read_whole_file (argv[1]);

f2 = read_whole_file (argv[2]);

l1 = strlen(f1);

l2 = strlen(f2);

for(i1 = 0; i1

lm = 0;//length of match

for(i2 = i1; i2

lm = 0;

while (f1[i1+lm] == f2[i2+lm] && (i1+lm

tempString[lm] = f1[i1+lm];

lm++;

}

if (lm> longestFound) {

tempString[lm]=0;//terminate string

strcpy(longestString, tempString);

longestFound = lm;

}

}

}

printf("longest string found is %d characters:n", longestFound);

printf("%sn", longestString);

free(f1);

free(f2);

return 0;

}