顺序表的增，删除，改，查

顺序表的增，删除，改，查

1.//主实现函数
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "sqlist.h"

sqlist_t *sqlist_create(void)
{
	sqlist_t *L=NULL;
	L = (sqlist_t*)malloc(sizeof(sqlist_t));
	if(L == NULL)
	{
		printf("malloc fail\n");
		return NULL;
	}
	L->last = -1;
	return L;
}
void sqlist_clean(sqlist_t *L)
{
	if(L == NULL)
	{
		printf("clean fail\n");
		return;
	}
	free(L);
}
int sqlist_is_full(sqlist_t *L)
{
	if(L == NULL)
        {
                printf("L is NULL\n");
                return -1;
        }
	return (L->last == MAX_LIST_LEN-1);
	
}
int sqlist_is_empty(sqlist_t *L)
{
	if(L == NULL)
        {
                printf("L is NULL\n");
                return -1;
        }
	return (L->last == -1);
	
	
}
int sqlist_insert(sqlist_t *L,data_t *T,int pos)
{
	if(sqlist_is_full(L))
	{
		printf("L is full,insert fail\n");
		return -1;
	}
	if((pos <0) || (pos > L->last+1))
	{
		printf("pos %d is error\n",pos);
		return -1;
	}
	for(int i=L->last;i>=pos;i--)
	{
		memcpy(&L->list[i+1],&L->list[i],sizeof(data_t));
		
	}	
	memcpy(&L->list[pos],T,sizeof(data_t));
	L->last ++;
	return 0;
}
void sqlist_show(sqlist_t *L)
{
	if(L != NULL)
	{
		for(int i=0;i<sqlist_get_size(L);i++)
		{
			printf("[%d].id=%d,data=%s\n",i,L->list[i].id,L->list[i].data);
		}
	}else{
		printf("show L NULL\n");
	}
}
int sqlist_get_size(sqlist_t *L)
{
	if(L == NULL)
        {
                printf("L is NULL\n");
                return -1;
        }
	return L->last+1;
	
}
int sqlist_delete(sqlist_t *L,int id)
{
	if(id<=0)
	{
		printf("remove argv is error:%d\n",id);
		return -1;
	}
	if(L != NULL)
	{
		int pos = sqlist_find(L,id);
		if(pos<0)
		{
			printf("delete fail,can't find %d\n",id);
			return -1;
		}
		for(int i=pos;i<sqlist_get_size(L);i++)
		{
			memcpy(&L->list[i],&L->list[i+1],sizeof(data_t));
		}
		L->last--;
	}else{
		printf("remove L null\n");
		return -2;
	}	
	return 0;

}
int sqlist_update(sqlist_t *L,data_t *data)
{
	if(data == NULL)
	{
		printf("update argv is null\n");
		return -3;
	}
	if(L != NULL)
	{
		for(int i=0;i<sqlist_get_size(L);i++)
		{
			if(L->list[i].id == data->id)
			{
				memcpy(&L->list[i].data,data->data,sizeof(data->data));
				return 0;
			}
		}
		printf("update,can find id:%d\n",data->id);
		return -1;
	}else{
		printf("update L null\n");
		return -2;
	}
	
}
int sqlist_find(sqlist_t *L,int id)
{
	if(id<=0)
        {
                printf("remove argv is error:%d\n",id);
                return -1;
        }
        if(L != NULL)
        {
                for(int i=0;i<sqlist_get_size(L);i++)
                {
                        if(L->list[i].id == id)
                        {
                              return i;
                        }
                }
        }else{
                printf("remove L null\n");
                return -2;
        }
	return 0;
}

//头文件
#ifndef __SQLIST_H__
#define __SQLIST_H__
#define MAX_DATA 5
#define MAX_LIST_LEN 3000 

typedef struct
{
	int id;
	char data[5];
}data_t;
typedef struct
{
	int last;
	data_t list[MAX_LIST_LEN];
}sqlist_t;

 
sqlist_t *sqlist_create(void);
void sqlist_clean(sqlist_t *L);
int sqlist_is_full(sqlist_t *L);
int sqlist_is_empty(sqlist_t *L);
int sqlist_insert(sqlist_t *L,data_t *data,int pos);
int sqlist_delete(sqlist_t *L,int id);
int sqlist_find(sqlist_t *L,int id);
int sqlist_update(sqlist_t *L,data_t *data);
void sqlist_show(sqlist_t *L);
int sqlist_get_size(sqlist_t *L);

#endif

//测试文件test.c
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "sqlist.h"
int main(int argc,char *argv[])
{
	sqlist_t *L=NULL;
	L = sqlist_create();

	printf("insert===插入十个数据========================");
	for(int i=0;i<10;i++)
	{
		data_t insert_data;
		memset(&insert_data,0,sizeof(data_t));
		insert_data.id = i;
		snprintf(insert_data.data,sizeof(insert_data.data)-1,"AA%d",i);
		sqlist_insert(L,&insert_data,L->last+1);
		
	}
	printf("size:%d\n",sqlist_get_size(L));
	sqlist_show(L);

	printf("delete id=3=========删除第3个数据==================");	
	sqlist_delete(L,3);
	printf("size:%d\n",sqlist_get_size(L));
	sqlist_show(L);

	printf("update id=6==========修改第6个数据=================");	
	data_t in_data;
	in_data.id=6;
	snprintf(in_data.data,sizeof(in_data.data),"%s","eeeee");
	sqlist_update(L,&in_data);
	printf("size:%d\n",sqlist_get_size(L));
	sqlist_show(L);

	printf("find id=5=============查找第5个数据的位置==============");
	printf("found:%d\n",sqlist_find(L,5));

	sqlist_clean(L);
	return 0;
}