【数据结构】C语言实现顺序表(动态顺序表)

#ifndef __SEQLIST_D_H__
#define __SEQLIST_D_H__

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<assert.h>

typedef int DataType;
#define INIT_NUM 3
#define INC_NUM 3
typedef struct seqlist
{
DataType* data;
int _size;
int _capacity;
}SeqList,*pSeqList;

//初始化
void InitSeqList(pSeqList plist)
{
assert(NULL != plist);

plist->data = (DataType*)malloc(sizeof(DataType)*INIT_NUM);
memset(plist->data, 0, sizeof(DataType)*INIT_NUM);
plist->_capacity = INIT_NUM;
plist->_size = 0;
}
//检测顺序表容量，若不够则扩容
void CheckCapacity(pSeqList plist)
{
assert(NULL != plist);
if (plist->_capacity == plist->_size)
{
DataType* tmp = (DataType*)realloc(plist->data, sizeof(DataType)*(plist->_capacity + INC_NUM));
plist->data = tmp;
plist->_capacity += INC_NUM;
}
}
//销毁
void DestroySeqList(pSeqList plist)
{
assert(NULL != plist);
plist->_size = 0;
plist->_capacity = 0;
free(plist->data);
plist->data = NULL;

printf("销毁成功！！！\n");
}
//打印顺序表
void PrintSeqList(SeqList plist)
{
int i = 0;
if (plist._size == 0)
{
printf("SeqList id empty...\n");
return;
}
for (i = 0; i < plist._size; i++)
{
printf("%d ", plist.data[i]);
}
printf("\n");
}
//尾插
void Push_back(pSeqList plist, DataType x)
{
assert(NULL != plist);
CheckCapacity(plist);
if (plist->_size == plist->_capacity)
{
printf("SeqList if full!!!\n");
return;
}
plist->data[plist->_size++] = x;
}
//尾删
void Pop_back(pSeqList plist)
{
assert(NULL != plist);
if (plist->_size == 0)
{
printf("SeqList is empty!!!\n");
return;
}
plist->_size--;
}
void Push_Front(pSeqList plist, DataType x)
{
assert(NULL != plist);
CheckCapacity(plist);

if (plist->_size == plist->_capacity)
{
printf("SeqList if full!!!\n");
return;
}
int index = plist->_size;
for (; index > 0; index--)
{
plist->data[index] = plist->data[index - 1];
}
plist->data[index] = x;
plist->_size++;
}
void Pop_Front(pSeqList plist)
{
assert(NULL != plist);
if (plist->_size == 0)
{
printf("SeqList is empty!!!\n");
return;
}
int index = 0;
for (; index < plist->_size; index++)
{
plist->data[index] = plist->data[index + 1];
}
plist->_size--;
}
//查找
int Find(SeqList plist, DataType x)
{
int index = 0;
for (; index < plist._size; index++)
{
if (x == plist.data[index])
return index;
}
return -1;
}
//指定位置插入
void Insert(pSeqList plist, DataType x, int pos)
{
assert(NULL != plist);
CheckCapacity(plist);

if ((pos >= plist->_capacity) && pos < 0)
{
printf("position is error!!!\n");
return;
}
int index = plist->_size;
for (; index>pos; index--)
{
plist->data[index] = plist->data[index - 1];
}
plist->data[index] = x;
plist->_size++;
}
//删除指定数字
void Remove(pSeqList plist, DataType x)
{
assert(NULL != plist);
if (plist->_size == 0)
{
printf("SeqList is empty!!!\n");
return;
}
int isFind = Find(*plist, x);
if (isFind > 0)
{
int index = isFind;
for (; index < plist->_size; index++)
{
plist->data[index] = plist->data[index + 1];
}
plist->_size--;
}
else
printf("not exist\n");

}
//删除指定所有元素
void RemoveAll(pSeqList plist, DataType x)
{
assert(NULL != plist);
if (plist->_size == 0)
{
printf("SeqList is empty!!!\n");
return;
}
int isFind = 0;
while ((isFind = Find(*plist, x)) != -1)
{
int index = isFind;
for (; index < plist->_size; index++)
{
plist->data[index] = plist->data[index + 1];
}
plist->_size--;
}
}

//这里写冒泡排序
void SortSeqList(pSeqList plist)
{
assert(NULL != plist);
int index = 0;
int index2 = 0;
int flag = 0;

for (; index < plist->_size - 1; index++)
{
flag = 1;
for (index2 = 0; index2 < plist->_size - index - 1; index2++)
{
if (plist->data[index2] > plist->data[index2 + 1])
{
DataType tmp = plist->data[index2];
plist->data[index2] = plist->data[index2 + 1];
plist->data[index2 + 1] = tmp;
flag = 0;
}
}
if (flag == 1)
return;
}
}
//逆置
void Reverse(pSeqList plist)
{
assert(NULL != plist);
int start = 0;
int end = plist->_size - 1;

while (start != end)
{
DataType tmp = plist->data[start];
plist->data[start] = plist->data[end];
plist->data[end] = tmp;
start++;
end--;
}
}
void BinarySearch(pSeqList plist, DataType x)
{
assert(NULL != plist);
int left = 0;
int right = plist->_size - 1;
int mid = (left + right) / 2;

while (left <= right)
{
int mid = (left + right) / 2;
if (plist->data[mid] == x)
{
printf("找到了，是第 %d 个\n", mid + 1);
return ;
}
else if (x > plist->data[mid])
{
left = mid + 1;
}
else if (x < plist->data[mid])
{
right = mid - 1;
}
}

printf("没有这个数\n");
}

#endif

#include"SeqList_D.h"

void FunTest1()
{
SeqList _list;
InitSeqList(&_list);

//尾插
Push_back(&_list, 1);
Push_back(&_list, 2);
Push_back(&_list, 3);
Push_back(&_list, 4);
Push_back(&_list, 5);
Push_back(&_list, 6);
Push_back(&_list, 2);
Push_back(&_list, 8);
Push_back(&_list, 2);

PrintSeqList(_list);
//尾删
Pop_back(&_list);
PrintSeqList(_list);
//头插
Push_Front(&_list, 0);
PrintSeqList(_list);
//头删
Pop_Front(&_list);
PrintSeqList(_list);
//指定位置插入
Insert(&_list, 6, 2);
PrintSeqList(_list);
//删除指定元素
Remove(&_list, 2);
PrintSeqList(_list);
//删除所有指定元素
RemoveAll(&_list, 2);
PrintSeqList(_list);
//逆置元素
/*Reverse(&_list);
PrintSeqList(_list);*/
//二分查找
BinarySearch(&_list, 5);
//冒泡排序
SortSeqList(&_list);
PrintSeqList(_list);
//销毁
DestroySeqList(&_list);
}

int main()
{
FunTest1();
system("pause");
return 0;
}