C语言数据结构学习之数组线性表

#ifndef _SEQLIST_H
#define _SEQLIST_H

#define LIST_INIT_SIZE 2
#define LIST_INCREMENT 1

typedef int  ElemType;

typedef struct{
	ElemType *elem;
	int length;
	int listsize;
	
}SeqList;


void addSeqList(SeqList* L,ElemType e);

void printSeqList(SeqList* L);

void deleteSeqList(SeqList *L,int index);

void insertSeqList(SeqList *L,int index ,ElemType elem);

void clearSeqList(SeqList *L);

void modifySeqList(SeqList *L,int index ,ElemType elem);



#endif

// 实现文件

#include "seqList.h"
#include <stdio.h>
#include<stdlib.h>

void addSeqList(SeqList* L,ElemType e)
{
	ElemType *it = L->elem;
	if(L==NULL || L->elem==NULL){
		printf("your yonger sister ,it is empty !");
		return;
	}
	
	if(L->length >= L->listsize)
	{
		L->listsize += LIST_INCREMENT;
	}
	
	it += L->length;
	*it = e;
	L->length++;
}	

void printSeqList(SeqList *L)
{
	int i;
	if(L==NULL || L->elem==NULL){
		printf("your younger sister ,it is empty !");
		return;
	}
	
	for(i = 0; i < L->length; ++i)
		printf("%d ",L->elem[i]);
	printf("\n");
}


void clearSeqList(SeqList *L)
{
	if(L==NULL || L->elem==NULL){
		printf("your younger sister ,it is empty !");
		return;
	}
	L->elem=NULL;
	free(L->elem);
	L->length=0;	
}

void deleteSeqList(SeqList* L,int index)
{
	int i;
	if(L==NULL || L->elem==NULL){
		printf("your younger sister ,it is empty !");
		return;
	}
	if(index>=L->length || index <0)
	{
		return;
	}
	
	for(i=index ;i<L->length-1;i++)
	{
		L->elem[i]=L->elem[i+1];
	}
	L->length-=1;
	
}

void insertSeqList(SeqList *L,int index ,ElemType elem)
{
	register int i;
	if(L==NULL || L->elem==NULL){
		printf("your younger sister ,it is empty !");
		return;
	}
	if(index>=L->length || index <0)
	{
		return;
	}
	
	for(i=L->length-1;i>=index;i--)
	{
		L->elem[i+1]=L->elem[i];
	}
	L->elem[index]=elem;
	L->length+=1;
}

void modifySeqList(SeqList *L,int index ,ElemType elem)
{
	
	if(L==NULL || L->elem==NULL){
		printf("your younger sister ,it is empty !");
		return;
	}
	if(index>=L->length || index <0)
	{
		return;
	}
	L->elem[index]=elem;
	
}

单元测试文件：

#include "seqList.h"
#include <stdio.h>
#include <stdlib.h>


int main(void)
{
	SeqList L;
	L.listsize = LIST_INIT_SIZE;
	L.length=0;
	L.elem = malloc(L.listsize * sizeof(ElemType));
	
	printf("%d\n ",L.length);
	
	printf("%d\n\n ",L.listsize);
	
	addSeqList(&L,1);
	addSeqList(&L,2);
	addSeqList(&L,3);
	addSeqList(&L,3);
	addSeqList(&L,3);
	addSeqList(&L,3);
	clearSeqList(&L);
	
    printf("%d\n",L.length);
	
	printf("%d\n\n",L.listsize);
	
	printSeqList(&L);
	
	L.elem = malloc(L.listsize * sizeof(ElemType));
	addSeqList(&L,1);
	addSeqList(&L,2);
	addSeqList(&L,3);
	addSeqList(&L,3);
	addSeqList(&L,3);
	addSeqList(&L,3);
	
	printSeqList(&L);
	
	insertSeqList(&L,2,100000);
	
	printSeqList(&L);
	
	modifySeqList(&L,2,9999999);
	printSeqList(&L);
	
	
	deleteSeqList(&L,2);
	
	printSeqList(&L);
	
	
	return 0;
}