线性表的顺序表示指的是用一组地址连续的存储单元一次存储线性表的数据元素,其中顺序表中所有存储的数据元素都是从data的0号下标连续的。
这里我们要实现的,便是定长顺序表。
首先我们先定义顺序表的结构:
struct SeqList
{
ElemType data[SIZE];
Int length;
};
其中SIZE是我选择用宏,因为是定长顺序表,没必要创造一个新变量。
我们要实现的基本功能如下:
废话不多说,直接上代码:
首先是.h文件,用来声明函数:
#pragma once
#define SIZE 10
typedef int ElemType;
typedef struct SeqList
{
ElemType data[SIZE];
int length;
}SeqList,*PList;
//初始化函数的声明
void InitSeqList(PList list);
//显示顺序表中所有元素
void ShowSeqList(PList list);
//头插 在0号位置插入
int InsertSeqListHead(PList list, ElemType val);
//尾插 在length位置插入
int InsertSeqListTail(PList list, ElemType val);
//按位置插入 1插入,将新元素放到1位置,之前包括1位置和之后的值统一向后移动
int InsertSeqListPos(PList list, ElemType val,int pos);
//头删
int DeleteSeqListHead(PList list);
//尾删
int DeleteSeqListTail(PList list);
//按位置删
int DeleteSeqListPos(PList list,int pos);
//按值删
int DeleteSeqListVal(PList list,ElemType val);
//清空
void ClearSeqList(PList list);
接下来是函数的代码:
#include "SeqList.h"
#include <stdio.h>
#include <assert.h>
#include <stdlib.h>
//判断指针是否为空
// static 使得此方法只能在本文件中使用
static void DeterPointIsNull(PList list)
{
assert(list != NULL);
if(list == NULL)
{
exit(0);//list为空直接结束进程
}
}
void InitSeqList(PList list)
{
//DeterPointIsNull(list);
assert(list != NULL);
if(list == NULL)
{
exit(0);//list为空直接结束进程
}
list->length = 0;
}
void ShowSeqList(PList list)
{
DeterPointIsNull(list);
for(int i = 0; i < list->length; ++i)
{
printf("%d ",list->data[i]);
}
printf("\n");
}
//头插 在0号位置插入
int InsertSeqListHead(PList list, ElemType val)
{
return InsertSeqListPos(list,val,0);
}
//尾插 在length位置插入
int InsertSeqListTail(PList list, ElemType val)
{
DeterPointIsNull(list);
return InsertSeqListPos(list,val,list->length);
}
//按位置插入 1插入,将新元素放到1位置,之前包括1位置和之后的值统一向后移动
int InsertSeqListPos(PList list, ElemType val,int pos)
{
//1.判断list是否为空
//2.判断当前顺序表是否满
//3.判断pos位置是否合法
//4.将原pos位置以及其后的元素统一向后移动,在pos位置插入元素
DeterPointIsNull(list);
if(list->length == SIZE)
{
printf("Insert fail,SeqList is Full.\n");
return 0;
}
if(pos<0 || pos > list->length)
{
return 0;
}
for(int i = list->length; i > pos; --i)
{
list->data[i] = list->data[i-1];
}
list->data[pos] = val;
list->length++;
return 1;
}
//头删
int DeleteSeqListHead(PList list)
{
return DeleteSeqListPos(list,0);
}
//尾删
int DeleteSeqListTail(PList list)
{
DeterPointIsNull(list);
return DeleteSeqListPos(list,list->length-1);
}
//按位置删
int DeleteSeqListPos(PList list,int pos)
{
DeterPointIsNull(list);
if(list->length == 0)
{
printf("Insert fail,SeqList is empty.\n");
return 0;
}
if(pos<0 || pos >= list->length)
{
printf("Insert fail,Pos is error.\n");
return 0;
}
for(int i = pos;i < list->length - 1;++i)
{
list->data[i] = list->data[i+1];
}
list->length --;
return 1;
}
//按值删 找到这个值的位置 然后按位置删
int DeleteSeqListVal(PList list,ElemType val)
{
DeterPointIsNull(list);
/*
for(int i = 0; i < list->length; )
{
if(val == list ->data[i])
{
DeleteSeqListPos(list, i);
continue;
} 此方法O(n^2) 时间复杂度过高
++i;
}*/
if(list->length == 0)
{
printf("List is Empty,Delete fail\n");
return 0;
}
int k = 0;
for(int i = 0; i < list->length; ++i)
{
if(list->data[i] != val)
{
list->data[k] = list->data[i];
k++;
}
}
list->length = k;
return 1;
}
//清空
void ClearSeqList(PList list)
{
DeterPointIsNull(list);
list->length = 0;
}
最后是主函数的测试用例:
#include "SeqList.h"
#include <stdio.h>
#include <assert.h>
int main()
{
SeqList list;
InitSeqList(&list);//不传地址类型不匹配,只传递值的话没法修改上面创建的list
for(int i = 0;i < 5;++i)
{
int res = InsertSeqListTail(&list,i+1);
assert(res != 0);
ShowSeqList(&list);
}
int res = InsertSeqListPos(&list,99,3);
assert(res != 0);
ShowSeqList(&list);
res = InsertSeqListPos(&list,99,3);
assert(res != 0);
ShowSeqList(&list);
res = InsertSeqListHead(&list,0);
assert(res != 0);
ShowSeqList(&list);
res = DeleteSeqListVal(&list,99);
assert(res != 0);
ShowSeqList(&list);
return 0;
}