顺序表的插入与删除
#include<stdio.h>
#include<stdlib.h>
#define InitSize 10
typedef struct {
int *data;
int MaxSize;
int length;
}SeqList;
void InitList(SeqList &L) {
L.data = (int *)malloc(sizeof(int)*InitSize);
L.length = 0;//初始化长度(空表)
L.MaxSize = InitSize;
}
void IncreaseSize(SeqList &L, int len) {
int *p = L.data;
L.data = (int *)malloc(sizeof(int)*(L.MaxSize + len));
for (int i = 0; i < L.length; i++) {
L.data[i] = p[i];//将数据复制到新区域
}
L.MaxSize = L.MaxSize + len;
free(p);
}
bool ListInsert(SeqList&L, int i, int &e) {
if (i<1 || i>L.length + 1 || L.length >=L.MaxSize)
{
printf("不能插入\n");
return false;
}
for (int j = L.length; j >= i; j--) {
L.data[j] = L.data[j - 1];
}
L.data[i - 1] = e;
L.length++;
return true;
}
//删除
bool ListDelete(SeqList &L, int i, int &e) {
if (i<1 || i>L.length) {
return false;
}
e = L.data[i - 1];//被删除的元素赋值给e
for (int j = i; j < L.length; j++) {
L.data[j - 1] = L.data[j];
}
L.length--;
return true;
}
int main() {
SeqList L;
InitList(L);
L.length = 5;
int e = -1;
for (int i = 0; i < L.length; i++)
{
L.data[i] = i;
}
int n = -1;
if (ListInsert(L, 2, n))
{
for (int i = 0; i < L.length; i++)
{
printf("data[%d]=%d\n", i, L.data[i]);
}
printf("插入第2个元素,插入的元素值为:%d\n", n);
}
else
printf("error\n");
if (ListDelete(L, 2, e))
{
for (int i = 0; i < L.length; i++)
{
printf("data[%d]=%d\n", i, L.data[i]);
}
printf("删除第2个元素,删除的元素值为:%d\n", e);
}
else
{
printf("error\n");
}
system("pause");
return 0;
}
运行结果如图:
总结思维导图: