北京理工大学2008级信息类c语言程序设计期末试题a卷.doc
还剩
8页未读,
继续阅读
下载文档到电脑,马上远离加班熬夜!
亲,喜欢就下载吧,价低环保!
内容要点:
}测试用例:输入 输出1. beijngdaxue↙ligong↙7↙ beijingligongdaxue↙ (公开)2. beijing↙daxue↙ 7↙ beijingdaxue↙ 3. ab↙cd↙5↙ abcd↙ (公开)4. abcd↙12↙1↙ a12cdb↙5. abcd↙12↙2↙ ab12cd↙6. abcd↙12↙3↙ abc12d↙7. abcd↙12↙0↙ 12abcd↙8. abcd↙↙ 2↙ ↙ (公开)9. ↙abcd↙ 1↙ ↙10. ↙↙ 2↙ ↙ 参考答案:一、A B B D/C C B B A B B二、C C B B A D B A D C SNODE *outlink( SNODE *head ){ while( head != NULL ){ printf("%c",head->ch);head = head->next;}return( head );}main( ){ char sa[100],sb[100];int i,n;SNODE *head1 = NULL, *head2 = NULL ;gets( sa );gets( sb );scanf( "%d", &n );if( *sa != ’\0’ && *sb != ’\0’ ){ head1 = setlink( sa );head2 = setlink( sb );head1 = inststr( head1, head2, n );outlink( head1 );}printf( "\n" );参考答案:SNODE *inststr(SNODE *heada, SNODE *headb, int n ){ int i;SNODE *q = heada, *p = NULL;if( n > 0 ){ for(i=1; inext != NULL; i++)q = q->next;p = q->next;q->next = headb;q = headb;while( q->next != NULL )q = q->next;if( p != NULL )q->next = p;}else { q = headb;while( q->next != NULL )q = q->next;q->next = heada;heada = headb;}return(heada);例如以链表方式保存的字符串“beijingdaxue”如下图:字符串“ligong”如下图:输入 n = 6 后,合并后的字符串如下图:结构定义是:typedef struct sdata { char ch;struct sdata *next;}SNODE; 函数原型是:SNODE *inststr(SNODE *heada, SNODE *headb
发表评论
暂无评论,赶快抢占沙发吧。