【C++】 ——教你C++实现一个简单的顺序表

顺序表

关于顺序表我不介绍了吧，重点记住这两句话：

• 顺序表的逻辑结构相邻，物理结构也相邻
• 是一组以数组形式保存的线性表

后面全部都是代码了，最重要的就是代码实现了，我分成三个部分test.h,main.c,test.c
test.c:

#pragma once
#include <iostream>
#include <stdlib.h>
#include <assert.h>
using namespace std;
typedef int SqlistType;

typedef struct SeqList
{
	SqlistType* array;
	size_t size;
	size_t capacity;
}Seq;

void SeqListInit(Seq* ps, size_t capacity);  //初始化
void SeqListDestroy(Seq* ps);  //销毁
void CheckCapacity(Seq* ps); //检查
void SeqListPushBack(Seq* ps, SqlistType val);  //尾部添加元素
void SeqListPopBack(Seq* ps); //尾部删除元素
void SeqListPrintf(Seq* ps);  //打印顺序表的元素
void SeqListPushFront(Seq* ps, SqlistType val);  //头部添加元素
void SeqListPopFront(Seq* ps); //头部删除元素
int  SeqListFind(Seq* ps, SqlistType val);  //查找元素
void SeqListPush(Seq* ps, size_t pos, SqlistType val);  //向某一位置添加元素
void Erase(Seq* ps, size_t pos);//删除某一位置的值
void SeqListModify(Seq* ps, size_t pos, SqlistType val);//修改某一位置的值
void SeqListBubbleSort(Seq* ps);  //顺序表的排序
void SeqListRemoveAll(Seq* ps, SqlistType val);  //删除某个值

main.c:

#include "test.h"

void SeqListInit(Seq* ps, size_t capacity)  //初始化
{
	assert(ps);
	ps->array = (SqlistType*)malloc(sizeof(SqlistType)*capacity);
	ps->size = 0;
	ps->capacity = capacity;
	CheckCapacity(ps);
}
void SeqListDestroy(Seq* ps)  //销毁
{
	assert(ps);
	free(ps->array);
	ps->array = NULL;
	ps->size = 0;
	ps->capacity = 0;
}
void CheckCapacity(Seq* ps) //检查
{
	assert(ps);
	if (ps->size == ps->capacity)
	{
		ps->capacity *= 2;
		//ps->array = realloc(ps->array, sizeof(int) * ps->capacity);
	}
}
void SeqListPushBack(Seq* ps, SqlistType val)  //尾部添加元素
{
	assert(ps);
	CheckCapacity(ps);
	ps->array[ps->size] = val;
	++ps->size;
}
void SeqListPopBack(Seq* ps) //尾部删除元素
{
	assert(ps);
	if (ps->size > 0)
	{
		--ps->size;
	}
}
void SeqListPrintf(Seq* ps)  //打印顺序表的元素
{
	assert(ps);
	for (int i = 0; i < ps->size; i++)
	{
		cout << ps->array[i] << " ";
	}
	cout << endl;
}
void SeqListPushFront(Seq* ps, SqlistType val)  //头部添加元素
{
	assert(ps);
	CheckCapacity(ps);
	int end = ps->size-1;
	while (end >= 0)
	{
		ps->array[end + 1] = ps->array[end];
		--end;
	}
	ps->array[0] = val;
	ps->size++;
}
void SeqListPopFront(Seq* ps) //删除头部元素
{
	assert(ps);
	int begin = 0;
	if (ps->size > 0)
	{
		while (begin < ps->size)
		{
			ps->array[begin] = ps->array[begin + 1];
			++begin;
		}
		ps->size--;
	}
	
}
int  SeqListFind(Seq* ps, SqlistType val)  //查找元素
{
	assert(ps);
	for (int i = 0; i < ps->size; i++)
	{
		if (ps->array[i] == val)
		{
			return i;
			break;
		}
	}
	return -1;
}
void SeqListPush(Seq* ps, size_t pos, SqlistType val) //向某一位置添加元素
{
	assert(ps&&pos<=ps->size);
	size_t end = (ps->size)-1;
	while (end >=(int)pos)
	{
		ps->array[end + 1] = ps->array[end];
		--end;
	}
	ps->array[end] = val;
	ps->size++;
}
void Erase(Seq* ps, size_t pos) //删除某一位置的值
{
	size_t begin = 0;
	assert(ps);
	begin = pos;
	while (begin < ps->size-1)
	{
		ps->array[begin] = ps->array[begin + 1];
		++begin;
	}
	ps->size--;
}
void SeqListModify(Seq* ps, size_t pos, SqlistType val)//修改某一位置的值
{
	assert(ps&&pos<ps->size-1);
	ps->array[pos] = val;
}
void SeqListBubbleSort(Seq* ps)  //顺序表的排序
{
	assert(ps);
	int tmp = 0, count = ps->size;
	int i = 0;
	while (--count)
	{
		for (i = 0; i < (int)ps->size - 1; i++)
		{
			if (ps->array[i] > ps->array[i + 1])
			{
				tmp = ps->array[i];
				ps->array[i] = ps->array[i + 1];
				ps->array[i + 1] = tmp;
			}
		}
	}
}
void SeqListRemoveAll(Seq* ps, SqlistType val)  //删除某个值
{
	assert(ps);
	int i = 0, j = 0;
	while (i < (int)ps->size)
	{
		if ((ps->array[i] != val))
		{
			ps->array[j] = ps->array[i];
		}
		++i;
	}
	ps->size = j;
}

test.c

#include "test.h"
int main()
{
	SeqList s;
	SeqListInit(&s, 3);
	SeqListPushBack(&s, 1);
	SeqListPushBack(&s, 2);
	SeqListPushBack(&s, 3);
	SeqListPrintf(&s);
	cout << endl;
	SeqListPopBack(&s);
	SeqListPrintf(&s);
	cout << endl;
	SeqListPushFront(&s, 8); //头部添加元素
	SeqListPushFront(&s, 6); //头部添加元素
	SeqListPrintf(&s);
	cout << endl;
	SeqListPopFront(&s); //删除头部元素
	SeqListPrintf(&s);
	cout << endl;
	system("pause");
	return 0;
}