C++程序设计教程参考答案第6章

1、习题1 结点数据之和：#include<iostream.h>struct Nodeint data;Node *next;int sum(Node* head)int s=0;while(head)s+=head->data;if(head->next)cout<<head->data<<"->"else cout<<head->data<<endl;head=head->next;return s;void main()Node node10,*h=node;for(int

2、i=0;i<10;i+)/建立链表nodei.data=i+1;if(i=9)nodei.next=0;else nodei.next=&nodei+1;cout<<"链表为："int s=sum(h);cout<<"各结点的数据域之和是："<<s<<endl;习题2 合并链表：#include<iostream.h>struct Nodeint data;Node *next;void print(Node* head)while(head)if(head->next)co

3、ut<<head->data<<"->"else cout<<head->data<<endl;head=head->next;Node* merge(Node* head1,Node* head2)推荐精选Node* head,*p;if(head1->data<head2->data)head=head1;head1=head1->next;elsehead=head2;head2=head2->next;p=head;while(head1&&head

4、2)if(head1->data<head2->data)p->next=head1;head1=head1->next;elsep->next=head2;head2=head2->next;p=p->next;if(head1)p->next=head1;else if(head2)p->next=head2;return head;void main()Node node110,*h1=node1,*h;Node node210,*h2=node2;for(int i=0;i<10;i+)/建立链表node1i.data=

5、i+1;node2i.data=2*i;if(i=9)node1i.next=0;node2i.next=0;else node1i.next=&node1i+1;node2i.next=&node2i+1;cout<<"链表1为："print(h1);推荐精选cout<<"链表2为："print(h2);h=merge(h1,h2);cout<<"合并后的链表为："print(h);习题3 删除x结点：#include<iostream.h>struct Linkint

6、 data;Link *next;void print(Link* h)while(h)if(h->next)cout<<h->data<<"->"else cout<<h->data<<endl;h=h->next;Link* build(Link* h,int n)/用数组h建立链表head Link *head=0,*p;for(int i=0;i<n;i+)p=new Link;p->data=hi.data;if(h=0)head=p;p->next=0;else /把

7、p插入head之前p->next=head;head=p;return head;Link* find(Link* h,int x)/不包括头结点为x的情况Link *p;while(h)p=h;h=h->next;if(h=0)return 0;推荐精选if(h->data=x)return p;return 0;int dele(Link* h,int x)Link* p1=find(h,x);if(!p1)return -1;Link* p2=p1->next;p1->next=p2->next;delete p2;return 0;void rele

8、ase(Link* h)Link *p;while(h)p=h;h=h->next;delete p;void main()Link L10,*h;for(int i=0;i<10;i+)Li.data=2*i;h=build(L,10);cout<<"链表为："print(h);int flag,x;cout<<"请输入x的值："cin>>x;if(h->data=x)/处理头结点为x的情况Link *p1=h;h=h->next;delete p1;flag=0;else flag=dele

9、(h,x);/处理头结点不为x的情况if(flag=-1)cout<<"链表中无值为"<<x<<"的结点。n"else cout<<"删除值为"<<x<<"的结点后，链表为：n"print(h);推荐精选release(h);习题4 链表约瑟夫环：#include<iostream.h>struct NODEint data;NODE *next;void print(NODE* h)NODE *p=h;while(p->ne

10、xt!=h)cout<<p->data<<"->"p=p->next;cout<<p->data<<endl;NODE* build(int n)/建立链表h NODE *h=0,*p,*pend;for(int i=1;i<=n;i+)p=new NODE;p->data=i;if(h=0) h=p;else pend->next=p;/把p插入pend之后pend=p;pend->next=h;return h;NODE* number(NODE* h,int m)NODE

11、*p=h,*p1;while(p->next!=p)for(int i=1;i<m;i+)p1=p;p=p->next;p1->next=p->next;cout<<p->data<<" "delete p;p=p1->next;推荐精选return p;void main()int n,m;cout<<"请输入人数："cin>>n;NODE *h=build(n);cout<<"链表为："print(h);cout<<"请输入报数终止值