数据结构-顺序表

1.heah.h

#ifndef HEAD_H_
#define HEAD_H_
#include 
#include 
#include 
#define maxsize 10
enum A{SUCCESS,FLASE=-1};
typedef int type;
typedef struct {
	type arr[maxsize];
	type len;
}SQlist;

SQlist * create();

int input(SQlist *list,type element);

int output(SQlist *list);
int delete(SQlist *list,type n);
int insert_sub(SQlist *list,type n,type element);
int delete_sub(SQlist *list,type sub);
int update_sub(SQlist *list,type sub,type element);
int search_sub(SQlist *list,type sub);
int delete_element(SQlist *list,type element);
int search_element(SQlist *list,type element);
int update_element(SQlist *list,type element,type element0);
int QUCHONG(SQlist *list);
int sort(SQlist *list);
SQlist* free_p(SQlist *list);
#endif

2.test.c

#include "head.h"
SQlist *create()
{
	SQlist *list=((SQlist*)malloc(sizeof(SQlist)));
	memset(list->arr,0,sizeof(list->arr));
	list->len=0;
	return list;
}

int input(SQlist *list,type element)
{
	if(list==NULL||list->len>maxsize)
	{
	return FLASE;
	}
	list->arr[list->len]=element;
	list->len++;
	return SUCCESS;
}

int output(SQlist *list)
{
	if(list==NULL||list->len>mSQlist* free_p(SQlist *list)SQlist* free_p(SQlist *list)axsize)
	{
	return FLASE;
	}
	for(type i=0;ilen;i++)
	{
		printf("%d ",list->arr[i]);
	}
	printf("\n");
	return SUCCESS;
}

int delete(SQlist *list,type n)
{
	if(list==NULL||list->len>maxsize)
	{
	return FLASE;
	}
	for(type i=0;iarr[list->len]==0;
		list->len--;
	}
	return SUCCESS;
}

int insert_sub(SQlist *list,type sub,type element)
{
	if(list==NULL||list->len>maxsize||sub<0||sub>list->len)
	{
	return FLASE;
	}
	list->len++;
	for(type i=list->len;i>sub;i--)
	{
		list->arr[list->len+1]=list->arr[list->len];
	}
	list->arr[sub]=element;
	return SUCCESS;
}

int delete_sub(SQlist *list,type sub)
{
	if(list==NULL||list->len>maxsize||sub<0||sub>list->len)
	{
	return FLASE;
	}
	for(type i=sub;ilen;i++)
	{
		list->arr[i]=list->arr[i+1];
	}
	list->arr[list->len]=0;
	list->len--;

}

int update_sub(SQlist *list,type sub,type element)
{
	if(list==NULL||list->len>maxsize||sub<0||sub>list->len)
	{
	return FLASE;
	}
	list->arr[sub]=element;
	return SUCCESS;
}

int search_sub(SQlist *list,type sub)
{
	if(list==NULL||list->len>maxsize||sub<0||sub>list->len)
	{
	return FLASE;
	}
	printf("在下标%d处的元素是%d\n",sub,list->arr[sub]);
	return SUCCESS;
}

int delete_element(SQlist *list,type element)
{
	if(list==NULL||list->len>maxsize)
	{
	return FLASE;
	}
	for(type i=0;ilen;i++)
	{
		if(list->arr[i]==element)
		{
		delete_sub(list,i);
		i--;
		}

	}
	return SUCCESS;
}

int search_element(SQlist *list,type element)
{
	if(list==NULL||list->len>maxsize)
	{
	return FLASE;
	}
	for(type i=0;ilen;i++)
	{
		if(list->arr[i]==element)
			printf("元素%d的下标是%d\n",element,i);
	}
	return 	SUCCESS;
}

int update_element(SQlist *list,type element,type element0)
{
	if(list==NULL||list->len>maxsize)
	{
	return FLASE;
	}
	for(type i=0;ilen;i++)
	{
		if(list->arr[i]==element)
		{
			list->arr[i]=element0;
		}
	}
	return SUCCESS;
}

int QUCHONG(SQlist *list)
{
	if(list==NULL||list->len>maxsize)
	{
	return FLASE;
	}
	for(type i=0;ilen;i++)
	{
		for(type j=i+1;jlen;j++)
		{
			if(list->arr[i]==list->arr[j])
			{
				delete_sub(list,j);
				j--;
			}
		}
	}
	return SUCCESS;
}

int sort(SQlist *list)
{
	type temp;
	if(list==NULL||list->len>maxsize)
	{
	return FLASE;
	}
	for(type i=0;ilen;i++)
	{
		for(type j=i;jlen;j++)
		{
			if(list->arr[i]>list->arr[j])
			{
			temp=list->arr[i];
			list->arr[i]=list->arr[j];
			list->arr[j]=temp;
			}
		}
	}
	return SUCCESS;
}

SQlist* free_p(SQlist *list)
{
	if(list==NULL)
	{
		return NULL;
	}
	free(list);
	list=NULL;
	return list;
}

3.main.c

#include "head.h"
int main(int argc,const char *argv[])
{
	SQlist *list=create();
	type n,element,sub,element0;
	printf("插入多少个元素\n");
	scanf("%d",&n);
	for(type i=0;i