1、.數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)報(bào)告實(shí)驗(yàn)?zāi)康?. 熟練掌握線性表的順序存儲(chǔ)結(jié)構(gòu)、鏈?zhǔn)酱鎯?chǔ)結(jié)構(gòu)，并分別實(shí)現(xiàn)線性表的基本操作。2. 熟練掌握順序存儲(chǔ)結(jié)構(gòu)中算法的實(shí)現(xiàn)。3. 培養(yǎng)編程和上機(jī)調(diào)試能力。實(shí)驗(yàn)容1. 建立含有若干元素的順序表，并實(shí)現(xiàn)插入、刪除、修改、查找等基本操作。并在屏幕上輸出。2. 建立含有若干元素的鏈?zhǔn)奖恚?shí)現(xiàn)插入、刪除、修改、查找等基本操作。并在屏幕上輸出。實(shí)驗(yàn)步驟打開(kāi) vc6.0，新建文件。編寫(xiě)代碼，運(yùn)行、調(diào)試、輸出結(jié)果。實(shí)驗(yàn)代碼順序表#include <iostream.h> #define elemtype int const int maxsize=1000; class se

2、quenlistprotected:elemtype amaxsize; int len;public:void setnull()len=0;void input(int n)for(int j=1;j<=n;j+) cin>>aj;len=n;void print(). . .for(int i=1;i<=len;i+) cout<<ai<<" "cout<<endl;void length()cout<<"現(xiàn)表長(zhǎng)度 "<<len<<endl;void i

3、nsert(elemtype x,int i)int j; if(len>=maxsize-1)cout<<"overflow"<<endl; else if(i<1)|(i>len+1)cout<<"position is not correct!"<<endl;elsefor(j=len;j>=i;j-)aj+1=aj; ai=x;len+;void deletel(int i)int j; if(i<1)|(i>len)cout<<"posit

4、ion is not correct!"<<endl;elsefor(j=i+1;j<=len;j+) aj-1=aj;len-;int locate(elemtype x)int j=1; while(j<=len)&&(aj!=x)j+;if(j<=len)return j;elsereturn 0;void change(elemtype x,elemtype y)int j; for(j=1;j<=len;j+)if(aj=x)aj=y;void main()sequenlist l; elemtype x,y; int n

5、,j; l.setnull();cout<<" 請(qǐng)輸入表中元素個(gè)數(shù)：" cin>>n;cout<<" 請(qǐng)輸入 "<<n<<" 個(gè)元素，建立順序表"<<endl; l.input(n);l.print();l.length;cout<<" 請(qǐng)輸入要插入的元素及位置："cin>>x>>j;l.insert(x,j);l.print();cout<<" 請(qǐng)輸入要?jiǎng)h除的元素位置：" c

6、in>>j;l.deletel(j);l.print();l.length;cout<<" 請(qǐng)輸入要查找的元素："cin>>x; j=l.locate(x); if(j!=0)cout<<x<<" 在第 "<<j<<" 個(gè)位置 "elsecout<<" 找不到 "cout<<endl;l.print();cout<<"請(qǐng)輸入要更新前的元素值："cin>>x;cout

7、<<"請(qǐng)輸入要更新后的元素值："cin>>y;l.change(x,y);l.print();鏈?zhǔn)奖恚?include <iostream.h> #define elemtype int class linkpublic:elemtype data; link *next;class linklistprotected:link *head; public:link *hcreat()link *s,*p; elemtype i;cout<<" 輸入多個(gè)結(jié)點(diǎn)數(shù)值（用空格分隔），為 0 時(shí)算法結(jié)束 "cin&

8、gt;>i; p=new link;p->next=null;while(i)s=new link; s->data=i;s->next=p->next; p->next=s; cin>>i;return p;void print (link *head)link *p; p=head->next;while(p->next!=null)cout<<p->data<<"->" p=p->next;cout<<p->data; cout<<end

9、l;link *locate(link *head,elemtype x)link *p; p=head->next;while(p!=null)&&(p->data!=x)p=p->next; return p;void deletel(link *head,elemtype x)link *p,*q; q=head; p=head->next;while(p!=null)&&(p->data!=x)q=p;p=p->next;if(p=null)cout<<" 要?jiǎng)h除的結(jié)點(diǎn)不存在"elseq

10、->next=p->next; delete(p);void insert(link *head,elemtype x,elemtype y)link *p,*s; s=new link; s->data=y;if(head->next=null)head->next=s; s->next=null;p=locate(head,x); if(p=null)cout<<" 插入位置非法 "elses->next=p->next; p->next=s;void change(link *p,elemtype x,

11、elemtype y)link *q; q=p->next;while(q!=null)if(q->data=x)q->data=y; q=q->next;int count(link *h)link *p; int n=0;p=h->next; while(p!=null)n+;p=p->next;return n;void main()int n; elemtype x,y; link *p,*q; linklist a; p=a.hcreat();a.print(p);cout<<" 請(qǐng)輸入要?jiǎng)h除的元素" cin>

12、>y;a.deletel(p,y);a.print(p);cout<<" 請(qǐng)輸入插入位置的元素值（將待插元素插入它的后面）" cin>>x;cout<<" 請(qǐng)輸入待插元素值" cin>>y;.a.insert(p,x,y); a.print(p);cout<<" 請(qǐng)輸入要修改前、后的元素值"cin>>x>>y; a.change(p,x,y); a.print(p);cout<<" 請(qǐng)輸入要查找的元素值" cin>>x;q=a.locate(p,x); if(q=null)