线性表动态分配顺序表示C/C++实现
#include <stdio.h>
#include <iostream>
using namespace std;
#define InitSize 100
typedef int ElemType;
typedef struct
{
ElemType *data;
int MaxSize, Length;
} SeqList;
void InitList(SeqList &L)
{
L.data = (ElemType *)malloc(sizeof(ElemType) * InitSize);
L.Length = 0;
L.MaxSize = InitSize;
}
void CreateList(SeqList &L, ElemType *data, int n)
{
for (int i = 0; i < n; i++)
L.data[i] = data[i];
L.Length = n;
}
void DestroyList(SeqList &L)
{
free(L.data);
L.data = NULL;
L.Length = 0;
L.MaxSize = 0;
}
int Length(SeqList L)
{
return L.Length;
}
bool Empty(SeqList L)
{
if (L.Length <= 0)
return true;
return false;
}
void IncreaseSize(SeqList &L, int len)
{
int *p = L.data;
L.data = new ElemType[InitSize + 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, ElemType e)
{
if (i < 0 || i > L.Length + 1)
return false;
if (L.Length >= L.MaxSize)
return false;
for (int j = L.Length; j >= i; j--)
L.data[j] = L.data[j - 1];
L.data[i] = e;
L.Length++;
return true;
}
bool ListDelete(SeqList &L, int i, int &e)
{
if (i < 0 || i > L.Length + 1)
return false;
if (L.Length > L.MaxSize)
return false;
e = L.data[i - 1];
for (int j = i - 1; j < L.Length; j++)
L.data[j] = L.data[j + 1];
L.Length--;
return true;
}
bool PrintList(SeqList &L)
{
if (L.Length > L.MaxSize)
return false;
for (int i = 0; i < L.Length; i++)
printf("L.data[%d]=%d\n", i, L.data[i]);
printf("L.Length=%d\n", L.Length);
return true;
}
ElemType GetElem(SeqList L, int i)
{
if (i < 0 || i > L.Length)
return -1;
return L.data[i - 1];
}
ElemType LocateElem(SeqList L, ElemType e)
{
for (int i = 0; i < L.Length; i++)
{
if (L.data[i] = e)
return i + 1;
return -1;
}
}
int main()
{
SeqList L;
InitList(L);
printf("是否为空表:%d\n", Empty(L));
ElemType data[] = {1, 2, 3, 4, 5};
int n = 5;
CreateList(L, data, n);
PrintList(L);
printf("-----------------------------------\n");
int e;
printf("删除操作:\n");
ListDelete(L, 2, e);
PrintList(L);
printf("-----------------------------------\n");
printf("插入操作:\n");
ListInsert(L, 3, 15);
PrintList(L);
printf("-----------------------------------\n");
printf("GetElem(L,3)=%d\n", GetElem(L, 3));
printf("LocateElem(L,3)=%d\n", LocateElem(L, 3));
printf("表长为:%d\n", Length(L));
DestroyList(L);
return 0;
}