数据结构实验2

《数据结构》实验报告实验序号：2 实验项目名称：顺序表的操作l->length=0;l->ListSize=LIST_INIT_SIZE;printf("ok");return 0;}}int ListInsert_Sq(sqlist *L,int i, ElemType e){ ElemType *q,*p;if(i<1 || i>L->length+1) return 1;if(L->length>=L->ListSize) {ElemType *newbase;newbase=( ElemType *)realloc(L->elem,(L->ListSize+LISTINCREMENT)*sizeof(ElemType));if(!newbase) return 1;L->elem=newbase;L->ListSize+=LISTINCREMENT;}q=&(L->elem[i-1]);for(p=&(L->elem [L->length-1]);p>=q;--p) *(p+1)=*p;*q=e;++L->length;return 0;}【要求】1、实现顺序表的插入、删除、按值查找等操作；2、假设构建的是非递减顺序表，设计算法实现从该有序顺序表中删除所有其值重复的元素，使得表中所有元素的值均不同。

四、实验结果与数据处理1：2：附源程序清单：1.#include<stdio.h>#include<stdlib.h>#define LIST_INIT_SIZE100 // 数组最大值#define INIT_ERROR-1 //初始化出错判断用typedef struct tadDATALIST//顺序表结构体{int nLength; //长度int anData[LIST_INIT_SIZE]; //数组int *pElem;}List, *pList;List C; //A和B组合后的新数组int InitList(pList D){int nLength = 0;int nInput = 0;char cOverSign ;//读取所有整数，输入回车结束输入while (1){if (scanf("%d", &nInput) != 1) //对于非法出入给出判断{printf("非法输入\n");return INIT_ERROR;}D-> anData[nLength] = nInput; //赋值nLength ++;if ((cOverSign = getchar()) == '\n') //按下回车键，结束输入{return nLength; //返回长度}}}int Alternate(pList anData_A, pList anData_B){C.nLength = 0; //初始化新数组的长度为0int nIndex1 = 0;int nIndex2 = 0;while((nIndex1 < anData_A -> nLength) && (nIndex2 < anData_B -> nLength)) //当有一个数组到达长度限制后，退出执行后两个while语句中的一个{C.anData[C.nLength] = anData_A->anData[nIndex1]; //先把A的第一个元素给cnIndex1 ++;C.nLength++;C.anData[C.nLength] = anData_B->anData[nIndex2]; //接着把B的第一个元素给CnIndex2 ++;C.nLength++;}while (nIndex1 < anData_A->nLength){C.anData[C.nLength] = anData_A->anData[nIndex1];nIndex1 ++;C.nLength++;}while (nIndex2 < anData_B->nLength){C.anData[C.nLength] = anData_B->anData[nIndex2];nIndex2 ++;C.nLength++;}return 0;}int main(){int nIndex = 0;List A; //创建结构体的对象List B;printf("输入顺序表A的元素，以回车结束输入: ");if ((A.nLength = InitList(&A)) == INIT_ERROR) //判断是否初始化出错{printf("初始化出错\n");return 0;}printf("输入顺序表B的元素，以回车结束输入: "); //判断是否初始化出错if ((B.nLength = InitList(&B)) == INIT_ERROR){printf("初始化出错\n");return 0;}/* printf("%d\n", A.nLength);printf("%d\n", B.nLength);for (nIndex = 0; nIndex < A.nLength; nIndex++){printf("%d ", A.anData[nIndex]);}printf("\n");for (nIndex = 0; nIndex <B.nLength; nIndex++){printf("%d ", B.anData[nIndex]);}printf("\n");*/Alternate(&A ,&B); //合成新数组printf("新的顺序表C为 : ");for (nIndex = 0; nIndex < C.nLength; nIndex++){printf("%d ", C.anData[nIndex]);}printf("\n");return 0;}2.#include<stdio.h>#include<stdlib.h># define LIST_INIT_SIZE100 //顺序表初始化大小# define LIS_TINCREMENT_SIZE 50 //空间不够时，增加大小#define INIT_ERROR -1#define INIT_SUCCESS0#define ERROR-1#define SUCCESS0typedef struct tagDataList//顺序表结构体封装数据{int *pBaseAddr; //基地址int nlength; //长度int nListSize; //分配大小}SqList, *pSqList;int InitList(pSqList List) //顺序表初始化函数{int nInput;char cOverSign;List->pBaseAddr = (int *)malloc(LIST_INIT_SIZE * sizeof(int)); //开辟空间大小if (!List->pBaseAddr) //判断是否开辟成功{return INIT_ERROR;}List->nlength = 0; //长度初始化为0List->nListSize = LIST_INIT_SIZE;//读取所有整数，输入回车结束输入while (1){if (scanf("%d", &nInput) != 1) //对于非法出入给出判断{printf("非法输入\n");return INIT_ERROR;}List->pBaseAddr[List->nlength] = nInput; //赋值List->nlength++; //自增if ((cOverSign = getchar()) == '\n') //按下回车键，结束输入{return INIT_SUCCESS;}}}int SqListInsert(pSqList List) //插入数据函数{int nIndex;int nVar;int *npNewBaseAddr = NULL; //新基地址int *npInsertPlace = NULL; //要插入的位置int *npTemp = NULL; //中间过渡变量printf("请输入要插入的位置和要插入的数: ");scanf("%d%d", &nIndex, &nVar);if (nIndex < 0 || nIndex > List->nlength + 1 ) //判断是否在范围内{printf("要插入的位置不在顺序表的范围\n");return ERROR;}if (List->nlength >= List->nListSize) //当超出初始化分配空间大小时，分配更大空间{printf("空间不够,重新分配大空间\n");npNewBaseAddr = (int *)realloc(List->pBaseAddr, (LIS_TINCREMENT_SIZE +LIST_INIT_SIZE) * sizeof(int));if (!npNewBaseAddr) //判断重新分配是否成功{printf("重新分配空间失败\n");return ERROR;}List->pBaseAddr = npNewBaseAddr; //把重新分配的基地址给原先的List->nListSize += LIS_TINCREMENT_SIZE;}npInsertPlace = &(List->pBaseAddr[nIndex - 1]); //记录要插入的位置的地址for(npTemp = &(List->pBaseAddr[List->nlength - 1]); npTemp >= npInsertPlace; npTemp--) {*(npTemp + 1) = *npTemp; //把相对于插入位置后面的数据往右边移动一个单位}*npInsertPlace = nVar; //把要插入的值赋值给相应位置List->nlength++;return SUCCESS;}int SqListDelete(pSqList List) //删除数据{int nIndex;int *npDeletePlace = NULL;int *npTemp = NULL;printf("请输入你要删除的位置: ");scanf("%d", &nIndex);if (nIndex < 0 || nIndex > List->nlength) //判断位置是否合法{printf("要删除的位置不在顺序表的范围\n");return ERROR;}npDeletePlace = &(List->pBaseAddr[nIndex - 1]); //记录位置npTemp = List->pBaseAddr + List->nlength - 1; //空间大小for (++npDeletePlace; npDeletePlace <= npTemp; ++npDeletePlace){*(npDeletePlace - 1) = *npDeletePlace; //相应元素往左边移动一个单位}List ->nlength--; //自减return SUCCESS;}int SqListFindVar(pSqList List, int nVar) //按值查找函数{int nIndex;int nSign = 0;int *npFindPlace = NULL;int *npTemp = NULL;for (nIndex = 0; nIndex < List->nlength; nIndex++){if (nVar == List->pBaseAddr[nIndex]) //找到就给出提示{printf("你要的数在第 %d 个位置,该数为: %d \n", nIndex + 1, List->pBaseAddr[nIndex]);nSign = 1;break;}else{continue;}}if (!nSign) //没找到给出提示{printf("该数值不存在于顺序表中\n");}return SUCCESS;}/*对非递减顺序表，设计算法实现从该有序顺序表中删除所有其值重复的元素，使得表中所有元素的值均不同*/int SqListDeleteTheSame(pSqList List){int nIndex1 = 0;int nIndex2 = 0;int nSign = 0;int *npDeletePlace = NULL;int *npTemp = NULL;for (nIndex1 = 0; nIndex1 < List ->nlength - 1; nIndex1++) //冒泡法实现。