用c语言实现顺序表

顺序表

test.c

#define _CRT_SECURE_NO_WARNINGS 1
#include "SeqList.h"


void Test()
{
	SL s;
	SeqListInit(&s);
	SeqListPushBack(&s, 1);
	SeqListPushBack(&s, 2);
	SeqListPushBack(&s, 3);
	SeqListPushBack(&s, 4);
	SeqListPushBack(&s, 5);


	SeqListPrint(&s);


	SeqListPopBack(&s);
	SeqListPopBack(&s);
	SeqListPrint(&s);




	SeqListPushFront(&s, 10);
	SeqListPushFront(&s, 20);
	SeqListPushFront(&s, 30);
	SeqListPushFront(&s, 40);
	SeqListPrint(&s);


	SeqListPopFront(&s);
	SeqListPopFront(&s);
	SeqListPrint(&s);


	int ret =SeqListFind(&s, 1);
	printf("%d\n", ret);


	SeqListInsert(&s, 1, 100);
	SeqListPrint(&s);
	SeqListInsert(&s, 5, 600);
	SeqListPrint(&s);


	SeqListErase(&s, 0);
	SeqListPrint(&s);


	SeqListErase(&s, 5);
	SeqListPrint(&s);




	SeqListDestory(&s);


}


int main()
{
	Test();
	return 0;
}









//seqlist.h
#pragma once
#include <stdio.h>
#include <assert.h>
#include <string.h>
#include <stdlib.h>



typedef int SLDataType;


typedef struct SeqList
{
	SLDataType* a;
	int size;
	int capacity;
}SL;


void SeqListPrint(SL* ps);
void SeqListInit(SL* ps);
void SeqListDestory(SL* ps);


void SeqListCheckCapacity(SL* ps);
void SeqListPushBack(SL* ps, SLDataType x);
void SeqListPopBack(SL* ps);
void SeqListPushFront(SL* ps, SLDataType x);
void SeqListPopFront(SL* ps);


// 找到了返回x位置下标，没有找打返回-1
int SeqListFind(SL* ps, SLDataType x);
// 指定pos下标位置插入
void SeqListInsert(SL* ps, int pos, SLDataType x);
// 删除pos位置的数据
void SeqListErase(SL* ps, int pos);







//seqlist.c
#define _CRT_SECURE_NO_WARNINGS 1
#include "SeqList.h"






void SeqListPrint(SL* ps)
{
	for (int i = 0; i < ps->size; i++)
	{
		printf("%d ", ps->a[i]);
	}
	printf("\n");
}




void SeqListInit(SL* ps)
{
	ps->a = NULL;
	ps->size = ps->capacity = 0;
}


void SeqListDestory(SL* ps)
{
	free(ps->a);
	ps->a = NULL;
	ps->size = ps->capacity = 0;
}


void SeqListCheckCapacity(SL* ps)
{
	if (ps->size == ps->capacity)
	{
		int newcapacity = ps->capacity == 0 ? 4 : ps->capacity * 2;
		SLDataType* tmp = (SLDataType*)realloc(ps->a,sizeof(SLDataType) * newcapacity);
		if (tmp == NULL)
		{
			printf("relloc failed\n");
			exit(-1);
		}
		ps->a = tmp;
		ps->capacity = newcapacity;
	}
}




void SeqListPushBack(SL* ps, SLDataType x)
{
	SeqListCheckCapacity(ps);
	ps->a[ps->size] = x;
	ps->size++;
}




void SeqListPopBack(SL* ps)
{
	assert(ps->size > 0);
	ps->a[ps->size-1]= 0;
	ps->size--;
}


void SeqListPushFront(SL* ps, SLDataType x)
{
	SeqListCheckCapacity(ps);
	int end = ps->size-1;
	while (end>=0)
	{
		ps->a[end + 1] = ps->a[end];
		end--;
	}
	ps->a[0] = x;
	
	ps->size++;
}




void SeqListPopFront(SL* ps)
{
	assert(ps->size > 0);
	int i = 1;
	for (i = 1; i < ps->size; i++)
	{
		ps->a[i - 1] = ps->a[i];
	}
	ps->size--;
}


// 找到了返回x位置下标，没有找打返回-1
int SeqListFind(SL* ps, SLDataType x)
{
	assert(ps->size > 0);
	for (int i = 0; i < ps->size; i++)
	{
		if (ps->a[i] == x)
		{
			return i;
		}
	}
	return -1;
}




// 指定pos下标位置插入
void SeqListInsert(SL* ps, int pos, SLDataType x)
{
	assert(pos >= 0 && pos <= ps->size);


	SeqListCheckCapacity(ps);
	int end = ps->size - 1;
	while (end >= pos)
	{
		ps->a[end + 1] = ps->a[end];
		end--;
	}
	ps->a[pos] = x;


	ps->size++;
}




// 删除pos位置的数据
void SeqListErase(SL* ps, int pos)
{
	assert(ps->size > 0);
	int end = pos;
	while (end < ps->size-1)
	{
		ps->a[end] = ps->a[end+1];
		end++;
	}
	ps->size--;
}