《数据结构》入门——C语言实现顺序表的各种操作代码分享

#include <stdio.h>
#include <stdlib.h>
#define LIST_INIT_SIZE   100
#define LISTINCREMENT    10
#define TRUE 1
#define FALSE 0
#define OVERFLOW -2
#define ERROR -1
typedef int Status;
typedef int ElemType;
#define OK 1
typedef struct {
	ElemType *elem;
	int length;
	int listsize;
}SqList;
void InitList_Sq(SqList *L)
{
	L->elem = (ElemType *)malloc(LIST_INIT_SIZE*sizeof(ElemType));
	if (!L->elem)
		exit(OVERFLOW);
	L->length =5;
	L->listsize = LIST_INIT_SIZE;
}
Status ListInsert_Sq(SqList *L,int i,ElemType e)
{
	int *newbase;
	int *q,*p;
	if(i<1||i>L->length+1)
	  return ERROR;
	if(L->length>=L->listsize)
	{
		newbase=(ElemType *)realloc(L->elem,(L->listsize+LISTINCREMENT)*sizeof(ElemType));
		if(! newbase)exit(OVERFLOW);
		L->elem=newbase;
		L->listsize += LISTINCREMENT;
	} 
	q=&(L->elem[i-1]);
	for(p=&(L->elem[L->length-1]);p>=q;--p)*(p+1)=*p;
	*q=e;
	++L->length;
	return OK;
}
Status Listempty(SqList L)
{
	if (L.length == 0)
		return TRUE;
	else
		return FALSE;
}
Status GetElem_Sq(SqList L,int i,ElemType *e) 
{
	if(i<1||i>L.length)
	  return ERROR;
    *e=L.elem[i-1];
    return OK;
}
int visit(int i)
{
	i = i+0 ;
	return i;
}
void  ListTraverse_Sq(SqList L)
{
	int i;
	for (i = 0; i <5; i++)
	{
		L.elem[i]=visit(L.elem[i]);
		printf("%d",L.elem[i]);
    }
}
Status ListDelete_Sq(SqList *L,int i,ElemType *e)
{
	int *q,*p;
	if(i<1||i>L->length)
	  return ERROR;
	p=&(L->elem[i-1]);
	e=p;
	q=L->elem+L->length-1;
	for(++p;p<=q;++p)
	  *(p-1)=*p; 
	--L->length;
	return OK;
}
Status ClearList_Sq(SqList *L)
{
	int i;
	int *q,*p;
	for(i=1;i<=5;i++)
	{
		p=&(L->elem[i-1]);
	    q=L->elem+L->length-1;
	    for(++p;p<=q;++p)
	       *(p-1)=*p; 
	    --L->length;
	}
	return OK;
}
Status DestroyList_Sq(SqList *L)
{
	free(L->elem);
	return OK;
}
Status ListLength_Sq(SqList L)
{
	return L.length;
}
int main()
{
	SqList L;
	int i,j,a;
    int *e;
	e=&j;
	InitList_Sq(&L);
	for (i = 1; i <=5; i++)
		ListInsert_Sq(&L, i, i);
	printf("数据元素的个数为：%d\n",ListLength_Sq(L));
	printf("如果为非空表输出0，空表输出1：%d\n", Listempty(L));
    printf("如果输出1，则GetElem运行成功：\n%d\n", GetElem_Sq(L, 3, e));
    printf("返回的i=3值为：\n");
	printf("%d\n",*e);
	ListTraverse_Sq(L);
	printf("\n");
	printf("请输入删除的位置：\n");
	scanf("%d",&a);
	printf("如果删除成功将返回1:\n");
	printf("%d\n",ListDelete_Sq(&L,a,e));
	printf("如果输出1，则将L重置为空表成功  %d\n",ClearList_Sq(&L));
    printf("如果输出1，则销毁线性表成功：%d\n",DestroyList_Sq(&L));
	system("pause"); 
	return 0;
}