《数据结构基础实验4》

L.list=(ElemType*)realloc(L.list,2*L.MaxSize*k); if(L.list==NULL){ cout<<"动态可分配的储存空间用完,退出运行!"<<endl; exit(1); } L.MaxSize=2*L.MaxSize;?}?for(i=L.size-1;i>=pos-1;i--) L.list[i+1]=L.list[i];?L.list[pos-1]=item;?L.size++;?returntrue;}ElemTypeGetList(SeqListL,intpos){//在线性表L中求序号为pos的元素,该元素作为函数值返回?if(pos<1||pos>L.size){ cerr<<"posisoutrange!"<<endl; exit(1);?}?returnL.list[pos-1];}Test4.cpp#include<stdio.h>#include<stdlib.h>#include<iostream.h>typedefintElemType;#defineMAXSize10#include"SeqList.h"voidmain(void){?SeqListmyList;?inti=1,x,sum=0,n; InitList(myList);?scanf("%d",&x);?while(x!=-1)?{ if(InsertList(myList,x,i)==0){ printf("错误!\n"); return; }i++;?scanf("%d",&x);?}?n=LengthList(myList);?for(i=1;i<=n;i++)?{ x=GetList(myList,i); sum=sum+x;?}?printf("%d\n",sum); ClearList(myList);}(黑色字为填空部分)