#include<stdio.h>
#include<stdlib.h>
#define LIST_INIT_SIZE 100
#define LISTINCREASESIZE 10
typedef struct{ //定义链表
int *elem;
int length;
int listsize;
}SqList;
void init_list(SqList &L){ //初始化链表，初始链表为0,1,2,3,4,5,6,7,8,9
L.elem=(int*)malloc(LIST_INIT_SIZE*sizeof(int));
L.length=0;
L.listsize=LIST_INIT_SIZE;
for(int i=0;i<10;i++){
L.elem[i]=i;
L.length++;
}
}
void print_list(SqList &L){
printf("当前链表为：\n");
for(int i=0;i<L.length;i++)
printf("%d ",L.elem[i]);
printf("\n");
}
void List_Insert_Sq(SqList &L,int i,int e){
printf("执行插入操作\n");
if(i<1||i>L.length+1){
printf("非法操作\n");
return;
}
if(L.length>=L.listsize){
int* newbase=(int *)realloc(L.elem,(L.listsize+LISTINCREASESIZE)*sizeof(int));
L.elem=newbase;
L.listsize+=LISTINCREASESIZE;
}
int* q=&(L.elem[i-1]);
for(int* p=&(L.elem[L.length-1]);p>=q;--p)
*(p+1)=*p;
*q=e;
++L.length;
}
void ListDelete(SqList &L,int i,int &e){
if((i<1)||(i>L.length)) return;
int *p=&(L.elem[i-1]);
e=*p;
int *q=L.elem+L.length-1;
for(++p;p<=q;++p) *(p-1)=*p;
--L.length;
return;
}
int main(){
SqList L;
init_list(L); //初始化一个链表
print_list(L); //将这个链表输出
List_Insert_Sq(L,3,4); //在第三个元素之前插入一个元素4
print_list(L); //将这个链表输出
int e;
ListDelete(L,6,e);
print_list(L);
printf("删除的元素的为%d\n",e);
return 0;
}
