C语言实现顺序表

SeqList.h#pragma once
#include<stdio.h>
#include<assert.h>
#include<string.h>
#define MAX_SIZE 5
typedef int DataType;
typedef struct SeqList
{
DataType seqList[MAX_SIZE];
size_t size;
}SeqList;
void InitSeqList(SeqList* seq);
void PrintSeqList(SeqList* seq);
void PushBack(SeqList* seq, DataType x);
void PopBack(SeqList* seq);
void PushFront(SeqList* seq, DataType x);
void PopFront(SeqList* seq);
void Insert(SeqList* seq, size_t pos, DataType x);
//// 返回-1表示未找到数据
int Find(SeqList* seq, DataType x);
void Erase(SeqList* seq, size_t pos);
void Remove(SeqList* seq, DataType x);
void RemoveAll(SeqList* seq, DataType x);
void Modify(SeqList* seq, size_t pos, DataType x);
void InitSeqList(SeqList* seq)//初始化 默认为零
{
assert(seq);
memset(seq, 0, MAX_SIZE*sizeof(DataType));
seq->size = 0;
}
void PrintSeqList(SeqList* seq)//遍历顺序表
{
assert(seq);
size_t index = 0;
if (seq->size == 0)
{
printf("顺序表为空！\n");
return;
}
for (; index < seq->size; ++index)
{
printf("%d\n", seq->seqList[index]);
}
}
void PushBack(SeqList* seq, DataType x)//尾插
{
assert(seq);
if (seq->size > MAX_SIZE)
return;
if (seq->size == MAX_SIZE)
{
printf("顺序表已满！\n");
return;
}
seq->seqList[(seq->size)++] = x;
}
void PopBack(SeqList* seq)//尾删
{
assert(seq);
if (seq->size == 0)
{
printf("顺序表已空！\n");
return;
}
--(seq->size);
}
void PushFront(SeqList* seq, DataType x)//头插
{
int end = seq->size;
assert(seq);
if (seq->size > MAX_SIZE)
seq->size = 0;
if (seq->size == MAX_SIZE)
{
printf("顺序表已满！\n");
return;
}
for (; end > 0; --end)
{
seq->seqList[end] = seq->seqList[end - 1];
}
seq->seqList[0] = x;
seq->size++;
}
void PopFront(SeqList* seq)//头删
{
size_t start = 0;
assert(seq);
if (seq->size == 0)
{
printf("顺序表已空！\n");
return;
}
for (; start <seq->size; ++start)
{
seq->seqList[start] = seq->seqList[start + 1];
}
--seq->size;
}
void Insert(SeqList* seq, size_t pos, DataType x)
{
int end = seq->size-1;
assert(seq);
if (seq->size > MAX_SIZE)
return;
if (pos > seq->size-1)
{
printf("不合法的插入位置！\n");
return;
}
if (seq->size == MAX_SIZE)
{
printf("顺序表已满！\n");
return;
}
for (; end >= pos; end--)
{
seq->seqList[end+1] = seq->seqList[end];
}
seq->seqList[pos] = x;
seq->size++;
}
int Find(SeqList* seq, DataType x)
{
size_t pos = 0;
assert(seq);
for (; pos < seq->size-1; ++pos)
{
if (seq->seqList[pos] == x)
return pos;
}
return -1;
}
void Erase(SeqList* seq, size_t pos)//按位置删除
{
size_t start = 0;
assert(seq);
if (seq->size == 0)
{
printf("顺序表已空！\n");
return;
}
start = pos;
for (; start <seq->size-1; ++start)
{
seq->seqList[start] = seq->seqList[start + 1];
}
--seq->size;
}
void Remove(SeqList* seq, DataType x)
{
int tag = 0;
assert(seq);
if (seq->size == 0)
{
printf("顺序表为空！\n");
return;
}
size_t index = 0;
for (; index < seq->size; ++index)
{
if (seq->seqList[index] == x)
{
for (; index < seq->size; ++index)
{
seq->seqList[index] = seq->seqList[index + 1];
}
--seq->size;
tag = 1;
}
}
if (tag == 0)
printf("未找到该元素！\n");
}
void RemoveAll(SeqList* seq, DataType x)
{
size_t pos = 0, start = 0;
assert(seq);
if (seq->size == 0)
{
printf("顺序表为空！\n");
return;
}
for (; pos < seq->size-1; ++pos)
{
if (seq->seqList[pos] == x)
{
for (start = pos; start < seq->size-1; ++start)
{
seq->seqList[start] = seq->seqList[start + 1];
}
--seq->size;
--pos;
}
}
}
void Modify(SeqList* seq, size_t pos, DataType x)
{
assert(seq);
if (pos > seq->size-1)
{
printf("不合法的插入位置！\n");
return;
}
seq->seqList[pos] = x;
}
test.c
#include"SeqList.h"
#include<stdlib.h>
void test()
{
SeqList Seq;
PushFront(&Seq, 0);
PushFront(&Seq, 3);
PushFront(&Seq, 3);
PushFront(&Seq, 3);
Insert(&Seq, 2, 4);
//PrintSeqList(&Seq); // 3 3 4 3 0
//printf("%d\n", Find(&Seq, 6));//找元素6，结果为-1
Erase(&Seq, 2);//清除第二个位置上的元素，结果为3 3 3 0
Modify(&Seq, 3, 5);//3 3 3 5
//RemoveAll(&Seq, 3);//清除元素3
PrintSeqList(&Seq);
}
int main()
{
SeqList Seq;
test(&Seq);
system("pause");
return 0;
}