线性表的顺序存储结构

---

一、顺序存储结构的定义

线性表的顺序存储结构，指的是一段地址连续的存储单元依次存储线性表的数据元素
在C语言中可以用一堆数组来实现顺序存储结构

存储空间的起始位置： 数组node
线性表的最大容量 ：数组长度MAXSIZE
线性表的当前长度：length

#define MAXSIZE 20

typedef struct _tag_List
{
char node[MAXSIZE];
int length;
}

二、基本操作

1.获取元素操作

实现思路

1. 判断线性表是否合法
2. 判断位置是否合法
3. 直接通过数组下标的方式获取下标

char Get(List* list, int pos)
{
char ret = -1;
//判断线性表和获取元素位置是否合法
if((list != NULL) && (0 <= pos) && (pos < list-> length))
{
//获取元素
ret = list->node[pos];
}
return ret;
}

2.插入元素操作

实现思路

1. 判断线性表是否合法
2. 判断插入位置是否合法
3. 把最后一个元素到插入位置的元素后移一个位置
4. 将新元素插入
5. 线性表长度加1

char Insert(List* list, char c, int pos)
{
//判断线性表是否合法
int ret = (list != NULL);
int i = 0;
//判断插入位置是否合法
ret = ret && (list->length +1 <= MAXSIZE);
ret = ret && (0 <= pos);
if(ret)
{
if(pos >= list->length)
{
pos = list->length;
}
//把最后一个元素到插入位置的元素后移一个位置
for(i = list->length; i> pos;i–)
{
list->node[i] = list->node[i-1];
}
//将新元素插入
list->node[i] = c;
//list长度加1
list->length++;
}
return ret;
}

3.删除元素操作

实现思路

1. 判断线性表是否合法
2. 判断删除位置是否合法
3. 取出删除元素
4. 把删除元素pos后的元素分别往前移动一个位置

char Delete(List* list, int pos)
{
char ret = -1;
int i = 0;
//判断线性表和删除位置是否合法
if(list != NULL) && (0 <= pos) && (pos < list->length)
{
//取出删除元素
ret = list->node[pos];
//把删除元素pso后的元素分别往前移动一个位置
for(int i = pos + 1; i < list-> length; i++)
{
list->node[i-1] = list->node[i];
}
//长度减1
list->length–;
}
return ret;
}

---

三.代码实现

#ifndef _SEQLIST_H_
#define _SEQLIST_H_

typedef void SeqList;
typedef void SeqListNode;

SeqList* SeqList_Create(int capacity);

void SeqList_Destroy(SeqList* list);

void SeqList_Clear(SeqList* list);

int SeqList_Length(SeqList* list);

int SeqList_Capacity(SeqList* list);

int SeqList_Insert(SeqList* list, SeqListNode* node, int pos);

SeqListNode* SeqList_Get(SeqList* list, int pos);

SeqListNode* SeqList_Delete(SeqList* list, int pos);

#endif

#include <stdio.h>
#include <malloc.h>
#include "SeqList.h"

typedef unsigned int TSeqListNode;

typedef struct _tag_SeqList
{
int capacity;
int length;
TSeqListNode* node;
}TSeqList;

SeqList* SeqList_Create(int capacity)
{
TSeqList* ret = NULL;

if(capacity >= 0)
{
ret (TSeqList*)malloc(sizeof(TSeqList)+sizeof(TSeqListNode)*capacity);
}
if(ret != NULL)
{
ret->capacity = capacity;
ret->length = 0;
ret->node = (TSeqListNode*)(ret + 1);
}
return ret;
}

void SeqList_Destroy(SeqList* list)
{
free(list);
}

void SeqList_Clear(SeqList* list)
{
TSeqList* sList = (TSeqList*)list;
if(sList != NULL) 
{
sList->length = 0;
}
}

int SeqList_Length(SeqList* list)
{
TSeqList* sList = (TSeqList*) list;
int ret = -1;
if(sList != NULL)
{
ret = sList->length;
}
return ret;
}

int SeqList_Capacity(SeqList* list)
{
TSeqList* sList = (TSeqList*) list;
int ret = -1;
if(sList != NULL)
{
ret = sList->capacity;
}

int SeqList_Insert(SeqList* list, SeqListNode* node, int pos)
{
TSeqList* sList = (TSeqList*)list;
int ret = (sList != NULL);
int i = 0;

ret = ret && (sList->length + 1 <= sList->capacity);
ret = ret && (0 <= pos);

if(ret)
{
if(pos >= sList->length)
{
pos = sList->length;
}

for(i = sList->length; i > pos; i--)
{
sList->node[i] = sList->node[i-1];
}

sList->node[i] = (TSeqListNode)node;

sList->length--;
}
return ret;
}

SeqListNode* SeqList_Get(SeqList* list, int pos)
{
TSeqList* sList = (TSeqList*)list;
SeqListNode* ret = NULL;
if((sList != NULL) && (0 <= pos) && (pos < sList->length))
{
ret = (SeqListNode*)(sList->node[pos]);
}
return ret;
}

SeqListNode* SeqList_Delete(SeqList* list, int pos)
{
TSeqList* sList = (TSeqList*)list;
SeqListNode* ret = SeqList_Get(list,pos);
int i = 0;
if(ret != NULL)
{
for(i = pos + 1; i <sList->length;i++)
{
sList->node[i-1] = sList->node[i];
}
sList->length--;
}
}

#include <stdio.h>
#include <stdlib.h>
#include "SeqList.h"

int main(int argc, char *argv[])
{
SeqList* list = SeqList_Create(5);

int i = 0;
int j = 1;
int k = 2;
int x = 3;
int y = 4;
int z = 5;
int index = 0;

SeqList_Insert(list,&i,0);
SeqList_Insert(list,&j,0);
SeqList_Insert(list,&k,0);
SeqList_Insert(list,&x,0);
SeqList_Insert(list,&y,0);
SeqList_Insert(list,&z,0);

for(index = 0; index < SeqList_Length(list);index++)
{
int *p = (int*)SeqList_Get(list,index);
printf("%d\n",*p);
}
printf("\n");
while(SeqList_Length(list)>0)
{
int *p = (int*)SeqList_Delete(list,0); 
printf("%d", *p);
}
SeqList_Destroy(list);
return 0;
}

四.小结

优点

1. 无需为线性表中的逻辑关系增加额外的空间
2. 可以快速地获取线性表中合法位置的元素

缺点

1. 插入和删除操作需要移动大量的元素
2. 当线性表长度变化较大时难以确定存储空间的容量