2009ÄêcÓïÑÔÊÔ¾í ÏÂÔØ±¾ÎÄ

»Ø-1¡£¸Ã³ÌÐò˼·£ºÖ¸Õëp¡¢q³õʼ¾ùÖ¸ÏòµÚÒ»¸ö½áµã£¬pÖ¸ÕëÏÈÑØÁ´±íÒÆ¶¯£¬µ±ÓëqÖ¸ÕëÏà²îk¸ö½áµãʱ£¬p¡¢qÖ¸Õëͬ²½Òƶ¯¡£ struct node {

int data;

struct node *next; };

int KthBackNode( struct node *h, int k ) { ___£¨1£©____; int count =0; p = q = h;

while ( p!=NULL && countnext;

___£¨2£©____; }

while ( p!=NULL ) {

___£¨3£©____;

q = q->next; }

if ( count < k ) return -1;

return ___£¨4£©____;

, 2010Äê1ÔÂ27ÈÕ /*hΪ±íÍ·Ö¸Õë*/

¡¶³ÌÐòÉè¼Æ»ù´¡¼°ÊµÑé¡·¿Î³ÌÆÚÄ©¿¼ÊÔÊÔ¾í 13 / 8

}

2. ÏÂÁгÌÐòͨ¹ýÃüÁîÐвÎÊý·½Ê½£¨prog file1 file2£©½«Á½¸öÎı¾ÎļþÖеÄÁ½¸ö´ÓСµ½´óµÄÕûÊýÐòÁкϲ¢ÎªÒ»¸ö´ÓСµ½´óµÄÐòÁС£×¢£ºfscanf£¨£©º¯Êý·µ»ØÖµÎª¶ÁÈëµÄÕûÊý¸öÊý£»end1ºÍend2·Ö±ðÓÃÓÚ±ê¼ÇÁ½¸öÎļþµÄÕûÊýÊÇ·ñ¶ÁÍֵ꣨1´ú±í¶ÁÍ꣩¡£ÀýÈ磺

Èç¹ûfile1ºÍfile2ÎļþÖеÄÄÚÈÝ·Ö±ðΪ£º 1 2 3 ºÍ 0 2 5 6£¬ÔòÊä³öΪ£º0 1 2 2 3 5 6¡£ #include

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

___£¨5£©____;

int n, m, end1=0,end2=0;

if (___£¨6£©____) {

printf(\ file1 file2\\n\ exit(0); }

if ((fp1=fopen(argv[1], \ (___£¨7£©____)) {

printf(\

}

if (fscanf(fp1, \

¡¶³ÌÐòÉè¼Æ»ù´¡¼°ÊµÑé¡·¿Î³ÌÆÚÄ©¿¼ÊÔÊÔ¾í, 2010Äê1ÔÂ27ÈÕ 14 / 8

if (fscanf(fp2, \while (___£¨8£©____)

if (n>m) { printf(\

if (fscanf(fp2, \

} else {

printf(\ ___£¨9£©____;

}

while (!end1) {

printf(\

}

while (!end2) {

printf(\ if (fscanf(fp2, \

}

___£¨10£©____; /*¹Ø±Õ´ò¿ªµÄÎļþ*/

return 0;

}

¡¶³ÌÐòÉè¼Æ»ù´¡¼°ÊµÑé¡·¿Î³ÌÆÚÄ©¿¼ÊÔÊÔ¾í, 2010Äê1ÔÂ27ÈÕ 15 / 8