顺序表按下标增删改查和按元素增删改查

 head.h

#ifndef __head_h__
#define __head_h__

#include <stdio.h>
#include <string.h>#include <stdlib.h>
#define MAXSIZE 7
enum POSSIBLE
{        SUCCESS=0,
        FALSE=-1};
typedef int datatype;
typedef struct
{        datatype data[MAXSIZE];
        int len;
}Sqlist;
Sqlist * create_sqlist();
int insert_rear(datatype element,Sqlist *list);
void output_sqlist(Sqlist*list);
int delete_rear(Sqlist* list);
int insert_sub(Sqlist*list,datatype sub,datatype element);
int delete_sub1(Sqlist* list,datatype sub1);
int delete_sub2(Sqlist* list,datatype sub2,datatype element);
int search_sub3(Sqlist* list,datatype sub3);
int search_element_delete(Sqlist* list,datatype element);
int search_element_change(Sqlist* list,datatype element,datatype element_new);

int search_element(Sqlist* list,datatype element);
#endif

main.c

#include "head.h"
int main(int argc, const char *argv[]){
        Sqlist *list=create_sqlist();
        int n;
		datatype element;
        printf("please enter n:");  
		scanf("%d",&n);
        for(int i=0;i<n;i++)
        {
                printf("please input number of element:");
                scanf("%d",&element);
                insert_rear(element,list);

        }
        output_sqlist(list);
		delete_rear(list);
		output_sqlist(list);
	
		//按下标插入
		datatype sub;
		printf("please enter inser element:");
		scanf("%d",&element);
		printf("please enter inser sub:");
		scanf("%d",&sub);
		insert_sub(list,element,sub);
		output_sqlist(list);
		//按下标删除
		datatype sub1;
		printf("please enter delete sub1:");
		scanf("%d",&sub1);
		delete_sub1(list,sub1);
		output_sqlist(list);
		//按下标修改
		datatype sub2;
		printf("please enter change sub2:");
		scanf("%d",&sub2);
		printf("please enter change element:");
		scanf("%d",&element);
		change_sub2(list,sub2,element);
		output_sqlist(list);
		//按下标查找
		datatype sub3;
		printf("please enter search sub3:");
		scanf("%d",&sub3);
		search_sub3(list,sub3);
		output_sqlist(list);
		//按元素删除
		printf("please enter delete element:");
		scanf("%d",&element);
		search_element_delete(list,element);
		output_sqlist(list);
		//按元素修改
		datatype element_new;
		printf("please enter change element:");
		scanf("%d",&element);
		printf("new element:");
		scanf("%d",&element_new);
		search_element_change(list,element,element_new);
		output_sqlist(list);
		//按元素查找
		printf("please enter search element:");
		scanf("%d",&element);
		search_element(list,element);
		output_sqlist(list);
		//去重
        printf("去重后结果为:");
		delete_same(list);
		output_sqlist(list);
		
        return SUCCESS;
}

 test.c

#include "head.h"
Sqlist * create_sqlist()
{
        Sqlist* list=(Sqlist*)malloc(sizeof(Sqlist));
                if (list==NULL)
                {
                        printf("false");
                        return NULL;
                } 
                        memset(list->data,0,sizeof(list->data));
                                list->len=0;
        return list;
}
//尾插
int insert_rear(datatype element,Sqlist*list)
{
        if(NULL==list||list->len==MAXSIZE)
        {
                printf("insert_rear err\n");
                return FALSE;
        }
        list->data[list->len]=element;
        list->len++;
        return SUCCESS;
}
//表的遍历
void output_sqlist(Sqlist*list)
{
        if(list==NULL||list->len==0)
        {
                printf("printf error");
                return FALSE;
        }
        for(int i=0;i<list->len;i++)
        {
                printf("%d",list->data[i]);
        }
		putchar(10);
}
//尾删
int delete_rear(Sqlist* list)
{
	if(NULL==list||list->len==0)
	{
		printf("delete_rear error\n");
		return FALSE;
	}
	list->data[list->len-1]=0;
	list->len--;
	return SUCCESS;
}
//按下标插入
int insert_sub(Sqlist *list,datatype element,datatype sub)
{
	if(NULL==list||list->len==MAXSIZE||sub<0||sub>list->len)
	{
		printf("insert_sub error\n");
		return FALSE;
	}
	for(int i=list->len-1;i>=sub;i--)
	{
		list->data[i+1]=list->data[i];
	}
	list->data[sub]=element;
	list->len++;
	return SUCCESS;
}
//按下标删除
int delete_sub1(Sqlist* list,datatype sub1)
{
	if(NULL==list||sub1<0||sub1>=list->len||list->len==0)
	{
		return FALSE;
		}
	for(int i=sub1+1;i<list->len;i++)
	{
		list->data[i-1]=list->data[i];
	}
	list->len--;

	return SUCCESS;
}
//按下标修改
int change_sub2(Sqlist* list,datatype sub2,datatype element)
{
	if(NULL==list||sub2<0||sub2>=list->len||list->len==0)
	{
		return FALSE;
	}
	list->data[sub2]=element;
	return SUCCESS;
}
//按下标查找
int search_sub3(Sqlist* list,datatype sub3)
{
	if(NULL==list||sub3<0||sub3>=list->len||list->len==0)
	{
		return FALSE;
	}
	printf("%d\n",list->data[sub3]);
	return SUCCESS;
}
//按元素删除
int search_element_delete(Sqlist* list,datatype element)
{
	if(NULL==0||list->len==0)
	{
		return FALSE;
	}
	for(int i=0;i<list->len;i++)
	{
		if(list->data[i]==element)
		delete_sub1(list,i);
	}
	return FALSE;
}
//按元素修改
int search_element_change(Sqlist* list,datatype element,datatype element_new)
{
	if(NULL==list||list->len==0)
	for(int i=0;i<list->len;i++)
	{
		if(list->data[i]==element)
			change_sub2(list,i,element_new);
	}
	return FALSE;
}
//按元素查找
int search_element(Sqlist* list,datatype element)
{
	if(NULL==list||list->len==0)
	{
		return FALSE;
	}
	int k;
	for(int i=0;i<list->len;i++)
	{
		if(list->data[i]==element)
			k=i;

	}
	printf("所查找的元素下标为%d\n",k);
	
	return SUCCESS;
}
//去重

int delete_same(Sqlist* list)
{
	if(NULL==list||list->len==0)
	{
		return FALSE;
	}
	for(int i=0;i<list->len;i++)
	{
		for(int j=i+1;j<list->len;j++)
		{
			if(list->data[i]=list->data[j])
			{
				delete_sub1(list,j);
				j--;
			}
		}
	}
	return SUCCESS;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值