数据结构顺序表--算法与数据结构

运算的实现：

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

//#define MAXNUM 100
typedef int DataType;

struct SeqList{
	int MAXNUM;
	int n;
	DataType *element;
};
typedef struct SeqList *PSeqList;

PSeqList createNullList_seq(int m)
{
	PSeqList palist = (PSeqList)malloc(sizeof(struct SeqList));
	if(palist!=NULL){
		palist->element = (DataType *)malloc(sizeof(DataType)*m);
		if(palist->element ){
			palist->MAXNUM  = m;
			palist->n = 0;
			return palist;	
		}
		else free(palist);
	}
	printf("Out of space!!\n");
	return NULL;
}

int isNullList_seq(PSeqList palist)
{
	return(palist->n == 0);
}

int locate_seq(PSeqList palist,DataType x)
{
	int q;
	for(q=0;q<palist->n;q++)
	{
		if(palist->element[q] == x)return q;
	}
	return -1;
}

int insertPre_seq(PSeqList palist,int p,DataType x)
{
	int q;
	if(palist->n >= palist->MAXNUM){
		printf("Overflow!\n");
		return 0;
	}
	if(p<0||p>palist->n){
		printf("Not exist!\n");
		return 0;
	}
	for(q=palist->n-1;q>=p;q--)
	{
		palist->element[q+1] = palist->element[q];
	}
	palist->element[p] = x;
	palist->n = palist->n+1;
	return 1;
}

int insertPost_seq(PSeqList palist,int p,DataType x)
{
	int q;
	if(palist->n >= palist->MAXNUM ){
		printf("Overflow!\n");
		return 0;
	}
	if(p<0||p>palist->n){
		printf("No exist!\n");
		return 0;
	}
	
	for(q=palist->n-1;q>p;q--)
	{
		palist->element[q+1] = palist->element[q];
	}
	palist->element[p+1] = x;
	palist->n = palist->n+1;
	return 1;
}

int deleteP_seq(PSeqList palist,int p){
	int q;
	if(p<0||p>palist->n-1){
		printf("Not exist!\n");
		return 0;
	}
	for(q=p;q<palist->n-1;q++)
	{
		palist->element[q] = palist->element[q+1];
	}
	palist->n = palist->n-1;
	return 1;
}

void listprin(PSeqList palist)
{
	int i;
	for(i=0;i<palist->n;i++)
	{
		printf("%d ",palist->element[i]);
	}
}

int main()
{
	PSeqList palist = createNullList_seq(5);
	int flag0 = isNullList_seq(palist);
	int flag1 = insertPre_seq(palist,0,1);
	int flag2 = insertPre_seq(palist,1,2);
	int flag3 = insertPre_seq(palist,2,3);
	listprin(palist);
	return 0;
	
}

输出：

1 2 3