#include <stdio.h>
#define OK 1
#define ERROR 0
#define OVERLOW -1
#define MAXSIZE 100
typedef int ElemType;
typedef struct {
ElemType *elem;
int length;
} SqList;
int InitList(SqList &L) {
L.elem=new ElemType[MAXSIZE];
if(!L.elem) return OVERLOW;
L.length=0;
return OK;
}
int Getlength(SqList *L,ElemType e4){
e4=L->length;
return e4;
}
int DestroyList(SqList &L) {
if(L.elem){
delete L.elem;
}
}
int ClearList(SqList &L) {
L.length=0;
}
int GetELem(SqList *L,int i,ElemType *e){
if(i<1||i>L->length){
return ERROR;
}
*e=L->elem[i-1];
return OK;
}
int LocateELem(SqList *L,ElemType e1){
for(int i=0;i<L->length;i++){
if(L->elem[i]==e1){
return i+1;
}
}
return 0;
}
int ListInsert_Sq(SqList *L,int i,ElemType e2){
if(i<1||i>L->length+1)return ERROR;
if(L->length==MAXSIZE)return ERROR;
for(int j=L->length-1;j>=i-1;j--){
L->elem[j+1]=L->elem[j];
L->elem[j]=e2;
L->length++;
return OK;
}
}
int ListDelet_Sq(SqList *L,int i){
if(i<1||i>L->length+1)return ERROR;
for(int j=i;j<=L->length-1;j++){
L->elem[j-1]=L->elem[j];
}
L->length--;
return OK;
}
int main() {
SqList L;
InitList(L);
printf("顺序表初始化完成\n");
DestroyList(L);
printf("顺序表销毁完成\n");
ClearList(L);
printf("顺序表清空完成\n");
L.elem[0]=10;
L.elem[1]=20;
L.elem[2]=30;
L.length=3;
ElemType e4;
int result4=Getlength(&L,e4);
printf("顺序表的长度为%d\n",result4);
ElemType e;
int result=GetELem(&L,2,&e);
if(result==OK){
printf("第2个元素的值为%d\n",e);
}else{
printf("获取元素失败\n");
}
ElemType e1=10;
int result1=LocateELem(&L,e1);
if(result!=0){
printf("查找成功为第%d个元素\n",result1);;
}else{
printf("查找失败\n");
}
ElemType e2=40;
int result2=ListInsert_Sq(&L,3,e2);
if(result2==OK){
printf("插入成功为第4个元素%d\n",e2);;
}else{
printf("插入失败\n");
}
int result3=ListDelet_Sq(&L,2);
if(result3==OK){
printf("成功删除为第2个元素\n");;
}else{
printf("插入失败\n");
}
return 0;
}
顺序表的基本操作
于 2024-04-08 23:04:42 首次发布
![](https://img-home.csdnimg.cn/images/20240611030827.png)