subject_40311.htm

一些关于vc的问答

<p>
序号：40311 发表者：黄本 发表日期：2003-05-17 16:07:57
<br>主题：一个链表连接的问题！
<br>内容：小的 我最近做了一道链表相连的题！自以为没什么问题！可是还是没有成功！请各位多多指教！<BR>程序如下：<BR>#include&lt;stdio.h&gt;<BR>#include&lt;malloc.h&gt;<BR>#define NULL 0<BR>#define ss struct student<BR>ss<BR>{ <BR>&nbsp;&nbsp;&nbsp;&nbsp;int num;<BR>&nbsp;&nbsp;&nbsp;&nbsp;int score;<BR>&nbsp;&nbsp;&nbsp;&nbsp;ss *next;<BR>};<BR>int n;<BR><BR>void main()<BR>{<BR>&nbsp;&nbsp;&nbsp;&nbsp;ss *creat();<BR>&nbsp;&nbsp;&nbsp;&nbsp;<BR>&nbsp;&nbsp;&nbsp;&nbsp;ss *plus(ss *head1,ss *head2);<BR>&nbsp;&nbsp;&nbsp;&nbsp;<BR>&nbsp;&nbsp;&nbsp;&nbsp;ss *p1,*p2,*p;<BR>&nbsp;&nbsp;&nbsp;&nbsp;p1=creat();<BR>&nbsp;&nbsp;&nbsp;&nbsp;p2=creat();<BR><BR>&nbsp;&nbsp;&nbsp;&nbsp;p=plus(p1,p2);<BR><BR>&nbsp;&nbsp;&nbsp;&nbsp;while(p!=NULL)<BR>&nbsp;&nbsp;&nbsp;&nbsp;{<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;printf("%d\t%d\n",p-&gt;num,p-&gt;score);<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;p=p-&gt;next;<BR>&nbsp;&nbsp;&nbsp;&nbsp;}<BR>}<BR><BR>ss *creat()<BR>{<BR>&nbsp;&nbsp;&nbsp;&nbsp;ss *head;<BR>&nbsp;&nbsp;&nbsp;&nbsp;ss *p1,*p2;<BR>&nbsp;&nbsp;&nbsp;&nbsp;p1=(ss *)malloc(sizeof (ss));<BR>&nbsp;&nbsp;&nbsp;&nbsp;p2=(ss *)malloc(sizeof (ss));<BR><BR>&nbsp;&nbsp;&nbsp;&nbsp;scanf("%d%d",&amp;p1-&gt;num,&amp;p1-&gt;score);<BR>&nbsp;&nbsp;&nbsp;&nbsp;head=NULL;<BR>&nbsp;&nbsp;&nbsp;&nbsp;while(p1-&gt;num!=0)<BR>&nbsp;&nbsp;&nbsp;&nbsp;{<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;n+=1;<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if(n==1)head=p1;<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;else p2-&gt;next=p1;<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;p2=p1;<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;p1=(ss *)malloc(sizeof (ss));<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;scanf("%d%d",&amp;p1-&gt;num,&amp;p1-&gt;score);<BR>&nbsp;&nbsp;&nbsp;&nbsp;}<BR>&nbsp;&nbsp;&nbsp;&nbsp;p2-&gt;next=NULL;<BR>&nbsp;&nbsp;&nbsp;&nbsp;return(head);<BR>}<BR><BR>ss *plus(ss *head1,ss *head2)<BR>{<BR>&nbsp;&nbsp;&nbsp;&nbsp;ss *p1;<BR>&nbsp;&nbsp;&nbsp;&nbsp;p1=head1;<BR>&nbsp;&nbsp;&nbsp;&nbsp;while(p1-&gt;next!=NULL)<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;p1=p1-&gt;next;<BR>&nbsp;&nbsp;&nbsp;&nbsp;p1-&gt;next=head2;<BR>&nbsp;&nbsp;&nbsp;&nbsp;return(head1);<BR>}<BR><BR>程序运行结果是没有将两链表连上，只显示了（自己输入的）第一个链表，（自己输入的）第二个链表 无法显示！
<br><a href="javascript:history.go(-1)">返回上页</a><br><a href=http://www.copathway.com/cndevforum/>访问论坛</a></p>
<hr size=1>
<blockquote><p>
<font color=red>答案被接受</font><br>回复者：Neil Gan 回复日期：2003-05-18 01:44:24
<br>内容：delete "int n;"<BR>add "int n=0;" to your "create" function.<BR><BR>经验之谈：每次使用非const全局变量的时候，都应该有一种罪恶感，也就是，能够避免就尽量避免。<BR><BR>你将来写大程序或多线程程序的时候，你就会知道了。<BR><BR>
<br>
<a href="javascript:history.go(-1)">返回上页</a><br><a href=http://www.copathway.com/cndevforum/>访问论坛</a></p></blockquote>