顺序表是C语言中一种基本的结构,可以存储各种基本类型的数据,而且不但可以存储基本类型的数据,也可以存储一种结构。一个顺序表应该具有的功能,头插,尾插,定点插入,排序等等都是一些最基本的功能,通过学习整理,下面来实现一下这些功能:
SeqList.h //头文件
#ifndef __SEQLIST_H__
#define __SEQLIST_H__
#include
#include
#include
#define MAX 10 //容量
typedef int DataType; //定义数据类型 int类型重命名为DataType
typedef struct SeqList
{
DataType data[MAX];
int sz; //计数
}SeqList, *pSeqList;
void InitSeqList(pSeqList ps); //顺序表初始化
void PushBack(pSeqList ps, DataType d); //尾部插入一个元素
void PopBack(pSeqList ps); //头部插入一个元素
void Display(const pSeqList ps); //打印顺序表
void PushFront(pSeqList ps, DataType d);//尾部删除一个元素
void PopFront(pSeqList ps);//投头部删除一个元素
int Find(pSeqList ps, DataType d);//查找
void Insert(pSeqList ps, DataType d, int pos);//在给定位置插入一个元素
void Remove(pSeqList ps, DataType d);//删除顺序表中第一个出现的指定元素
void RemoveAll(pSeqList ps, DataType d);//删除顺序表中所有指定的元素
void Reverse(pSeqList ps);//逆序顺序表
void Sort(pSeqList ps);//排序
int BinarySearch(pSeqList ps, DataType d);//二分查找
#endif //__SEQLIST_H__
SeqList.c //函数的实现
//#include
#include "SeqList.h"
void InitSeqList(pSeqList ps)
{
ps->sz = 0;
memset(ps->data, 0, sizeof(ps->data));//初始化
}
void PushBack(pSeqList ps, DataType d)
{
assert(ps != NULL);
if (ps->sz == MAX)
{
return; //元素满了直接返回
}
ps->data[ps->sz] = d;
ps->sz++;
}
void PopBack(pSeqList ps)
{
assert(ps != NULL);
if (ps->sz == 0)
{
return;
}
ps->sz--;
}
void Display(const pSeqList ps) //打印
{
int i = 0;
assert(ps != NULL);
for (i = 0; isz; i++)
{
printf("%d ", ps->data[i]);
}
printf("\n");
}
void PushFront(pSeqList ps, DataType d)
{
int i = 0;
assert(ps != NULL);
if (ps->sz == MAX)
{
return;
}
for (i = ps->sz; i > 0; i--)
{
ps->data[i] = ps->data[i - 1];//头部插入时需要把元素整体向后移动
}
ps->data[0] = d;
ps->sz++;
}
void PopFront(pSeqList ps)
{
int i = 0;
assert(ps != NULL);
if (ps->sz == 0)
{
return;
}
for (i = 0; i < ps->sz - 1; i++)
{
ps->data[i] = ps->data[i + 1];
}
ps->sz--;
}
int Find(pSeqList ps, DataType d)
{
int i = 0;
assert(ps != NULL);
for (i = 0; i < ps->sz; i++)
{
if ((ps->data[i]) == d)
{
return i;
}
}
return -1; //没找到返回-1
}
void Insert(pSeqList ps, DataType d, int pos)//插入
{
int i = 0;
assert(ps != NULL);
if (pos == -1)
{
return;
}
if (ps->sz == MAX)
{
return;
}
for (i = ps->sz; i > pos; i--)
{
ps->data[i] = ps->data[i - 1];
}
ps->data[pos] = d;
ps->sz++;
}
void Remove(pSeqList ps, DataType d)
{
int i = 0;
assert(ps != NULL);
int pos = Find((pSeqList)ps->data, d);
printf("%\n", pos);
if (ps->sz == 0)
{
return;
}
if (pos != -1)
{
for (i = pos; i < ps->sz - 1; i++)
{
ps->data[i] = ps->data[i + 1];
}
}
ps->sz--;
}
void RemoveAll(pSeqList ps, DataType d) //移除所有的d
{
int i = 0;
int j = 0;
assert(ps != NULL);
int pos = Find(ps, d);
if (ps->sz == 0)
{
return;
}
for (i = 0; isz; i++)
{
if (d == ps->data[i])
{
Remove((pSeqList)ps->data, d);
}
}
i++;
}
}
void Reverse(pSeqList ps) //逆序
{
int left = 0;
int right = ps->sz - 1;
assert(ps != NULL);
if (ps->sz == 0)
{
return;
}
while (left < right)
{
DataType tmp = ps->data[left];
ps->data[left] = ps->data[right];
ps->data[right] = tmp;
left++;
right--;
}
}
void Sort(pSeqList ps) //排序 小—>—大
{
int i = 0;
int j = 0;
assert(ps != NULL);
if (ps->sz == 0)
{
return;
}
for (i = 0; i < ps->sz; i++)
{
for (j = 0; j < ps->sz - 1 - i; j++)
{
if (ps->data[j]>ps->data[j + 1])
{
int tmp = ps->data[j];
ps->data[j] = ps->data[j + 1];
ps->data[j + 1] = tmp;
}
}
}
}
int BinarySearch(pSeqList ps, DataType d) //二分法查找
{
int left = 0;
int right = ps->sz - 1;
assert(ps != NULL);
if (ps->sz == 0)
{
return;
}
while (left <= right)
{
int mid = left + ((right - left) >> 1);
if (d > ps->data[mid])
{
left = mid + 1;
}
else if (d < ps->data[mid])
{
right = mid - 1;
}
else
{
return mid;
}
}
return -1;
}
test.c //测试代码
#include
#include "SeqList.h"
void test1()
{
SeqList my_list;
InitSeqList(&my_list);
PushBack(&my_list, 1);
PushBack(&my_list, 2);
Display(&my_list);
PushBack(&my_list, 3);
PushBack(&my_list, 4);
Display(&my_list);
PopBack(&my_list);
Display(&my_list);
PopBack(&my_list);
Display(&my_list);
PopBack(&my_list);
Display(&my_list);
PopBack(&my_list);
Display(&my_list);
}
void test2()
{
int pos = 0;
SeqList my_list;
InitSeqList(&my_list);
PushFront(&my_list, 1);
PushFront(&my_list, 2);
PushFront(&my_list, 3);
PushFront(&my_list, 4);
Display(&my_list);
PopFront(&my_list);
Display(&my_list);
PopFront(&my_list);
Display(&my_list);
PopFront(&my_list);
Display(&my_list);
PopFront(&my_list);
Display(&my_list);
}
void test3()
{
SeqList my_list;
InitSeqList(&my_list);
PushBack(&my_list, 1);
PushBack(&my_list, 2);
PushBack(&my_list, 3);
PushBack(&my_list, 6);
PushBack(&my_list, 3);
PushBack(&my_list, 2);
Display(&my_list);
Remove(&my_list, 3); //删除3
Display(&my_list); //
RemoveAll(&my_list, 2); //删除所有2
Display(&my_list);
}
void test4()
{
int pos = 0;
SeqList my_list;
InitSeqList(&my_list);
PushBack(&my_list, 1);
PushBack(&my_list, 2);
PushBack(&my_list, 3);
PushBack(&my_list, 4);
Display(&my_list);
pos = Find(&my_list, 3); //查找
printf("%d\n", pos);
Insert(&my_list, 5, pos); //插入
Display(&my_list);
Sort(&my_list); //排序
Display(&my_list);
pos = BinarySearch(&my_list, 3);//二分查找
printf("%d\n", pos);
}
void test5()
{
int pos = 0;
SeqList my_list;
InitSeqList(&my_list);
PushFront(&my_list, 1);
PushFront(&my_list, 2);
PushFront(&my_list, 3);
PushFront(&my_list, 4);
PushFront(&my_list, 5);
PushFront(&my_list, 1);
Display(&my_list);
Reverse(&my_list); //逆序
Display(&my_list);
}
int main()
{
test5();
return 0;
}