day13 顺序表作业

 

 

 

 

---

---

---

 head.h

#ifndef __HEAD_H__
#define __HEAD_H__

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define MAXSIZE 10 
typedef int datatype;
//申请空间
typedef struct
{
	datatype data[MAXSIZE];
	int len;
}seqlist;

seqlist *create();

//


void menue();

int full_seqlist(seqlist *list);//判断是否表满
int empty_seqlist(seqlist *list);//判断是否表空

int insert_rear();//尾部插入
int find_sub();//查询下标
int delete_rear ();//尾部删除
int output();
int regets_sub();//下标修改值
int insert_sub();//插入下标和值
int del_sub();//删除下标对应值

int find_data();//按照元素查找
int insert_num();//按照元素插入
int delete_data();//按照元素删除
int regets_data();//按照元素修改
int bubble();//顺序表排列


seqlist * free_space();//释放空间

#endif

---

---

---

test.c

#include "head.h"

void menue()
{
	puts("\t****************");
	puts("\t1,表尾插入");
	puts("\t2,表尾删除");
	puts("\t3,顺序遍历表");
	puts("\t4,按照下标查找元素");
	puts("\t5,按照下标修改元素");
	puts("\t6,按照下标插入元素");
	puts("\t7,按照下标删除元素");
	puts("\t8,按照元素查找");
	puts("\t9,按照元素插入");
	puts("\t10,按照元素删除");
	puts("\t11,按照元素修改");
	puts("\t12,顺序表排序");
	puts("\t20,释放顺序表空间");
	puts("\t0,退出整个程序");
	puts("\t****************");
	
}

seqlist *create()
{
	seqlist *list = (seqlist *)malloc(sizeof(seqlist));
	if (list == NULL)
	{
		return NULL;
	}
	list ->len =0;
	return list;
}

int full_seqlist(seqlist *list)//顺序表满
{
	return list->len==MAXSIZE?-1:0;
}

int empty_seqlist(seqlist *list)//顺序表空
{
	return list->len==0?-1:0;
}

//尾部删除
int delete_rear (seqlist *list)
{
	if(list == NULL||empty_seqlist)
	{
		printf("删除失败\n");
		return -1;
	}
	list->len--;
	return 0;
}


//尾部插入
int insert_rear(datatype e,seqlist *list)
{
	//判断是否表满
	if(list ==NULL ||full_seqlist(list))
	{
		printf("插入失败\n");
		return -1;
	}
	//可以插入
	list->data[list->len]=e;
	list->len++;
	return 0;
}

//输出
int output(seqlist *list)
{
	//1、判断顺序表是否为空
	//2、判断顺序表是否创建成功
	if(list ==NULL ||list->len ==0)
	{
		puts("顺序表为空或未创建成功\n");
		return -1;
	}
	//成功
	for(int i=0;i<list->len;i++)
	{
		printf("%d\t",list->data[i]);
	}
	puts("");
	
}

//查找下标对应元素
int find_sub(seqlist *list,int sub)
{
	//1、判断顺序表是否创建成功
	//2、判断顺序表是否为空
	//3、判断下标是否合法
	if(list == NULL||empty_seqlist(list)||sub<0||sub>=list->len)
	{
		printf("查找失败\n");
		return -1;
	}
	//4、查找==》输出
	printf("查找到的元素是：%d\n",list->data[sub]);
	return 0;

}

//查找下标修改对应值
int regets_sub(seqlist *list,int sub,int n)
{
	//1、判断顺序表是否创建成功
	//2、判断顺序表是否为空
	//3、判断下标是否合法
	if(list == NULL||empty_seqlist(list)||sub<0||sub>=list->len)
	{
		printf("修改失败\n");
		return -1;
	}
	//查找到元素并修改
	list->data[sub]=n;
	printf("修改成功\n");
	return 0;
}
	
//查找下标插入值
int insert_sub(seqlist *list,int sub,int n)
{
	if(list == NULL||full_seqlist(list)||sub<0||sub>list->len)
	{
		printf("插入元素失败\n");
		return -1;
	}
	for(int i =list->len -1;i>=sub;i--)
	{
		list->data[i+1]=list->data[i];
	}
		list->data[sub] = n;
		list->len++;
		printf("插入元素成功\n");
		return 0;
}

//删除下标对应值
int del_sub(seqlist *list,int sub)
{
	if(list == NULL||empty_seqlist(list)||sub<0||sub>list->len)
	{
		printf("删除元素失败\n");
		return -1;
	}
	for(int i=sub+1;i<list->len;i++)
	{
		list->data[i-1]=list->data[i];
	}
	list->len--;
	printf("删除成功\n");
	return 0;
}


//按元素查找
int find_data(seqlist *list,datatype n)
{
	if(list ==NULL || empty_seqlist(list))
	{
		return -1;
	}
	for(int i=0;i<list->len;i++)
	{
		if(list->data[i]==n)
		{
			return i;
		}
	}
	return -1;
}

//按元素插入
int insert_num(seqlist *list,int key,datatype e)
{
	if(list == NULL || full_seqlist(list))
	{
		return -1;
	}
	int sub = find_data(list,key);
	for(int i=list->len-1;i>sub;i--)
	{
		list->data[i+1]=list->data[i];
	}
	list->data[sub+1]=e;
	list->len++;
	puts("插入成功");
	return 0;
}

//按照元素删除
int delete_data(seqlist *list,datatype key)
{
	int sub = find_data(list,key);
	if(sub ==-1)
	{
		return -1;
	}
	del_sub(list,sub);
	return 0;

}

//按照元素修改
int regets_data(seqlist *list,int key,datatype e)
{
	if(list == NULL || empty_seqlist(list))
	{
		printf("修改失败\n");
		return -1;
	}
	for(int i=0;i<list->len;i++)
	{
		if(key==list->data[i])
		{
			list->data[i]=e;
			printf("修改成功\n");
			return 0;
		}
	}
	printf("修改失败\n");
	return -1;
}

//顺序表排序
int bubble(seqlist *list)
{
	for(int i=1;i<list->len;i++)
	{
		for(int j=0;j<list->len - i;j++)
		{
			if(list->data[j]>list->data[j+1])
			{
				int temp = list->data[j];
				list->data[j]=list->data[j+1];
				list->data[j+1]=temp;
			}
		}
	}
	printf("排序完成\n");
	return 0;
}








//释放空间
seqlist *free_space(seqlist *list)
{
	if(list == NULL)
	{
		return NULL;
	}
	free(list);
	list == NULL;
	list->len = 0;
	return list;
}

---

---

---

main.c

#include "head.h"
int main(int argc, const char *argv[])
{
	//在堆区创建空间
	seqlist *list = create();

	menue();
	int number;
	while(1)
	{
		printf("请输入您的选择：");
		scanf("%d",&number);
		switch(number)
		{
		case 1:
			{
				int n;
				datatype e;
				printf("请输入尾插个数：");
				scanf("%d",&n);
				for (int i=0;i<n;i++)
				{
					printf("请输入您要插入的数据元素：");
					scanf("%d",&e);
					insert_rear(e,list);
				}
			}
			break;
		case 2:
			{
				delete_rear(list); 
			}
			break;
		case 3:
			{
				output(list);
			}
			break;
		case 4:
			{
				int sub;
				printf("请输入要查询的下标");
				scanf("%d",&sub);
				find_sub(list,sub);
			}
			break;
		case 5:
			{
				int sub;
				datatype n;
				printf("请输入要修改的下标与值");
				scanf("%d %d",&sub,&n);
				regets_sub(list,sub,n);
			}
			break;
		case 6:
			{
				int sub;
				datatype n;
				printf("请输入要插入的下标与值");
				scanf("%d %d",&sub,&n);
				insert_sub(list,sub,n);
				
			}
			break;
		case 7:
			{
				int sub;
				printf("请输入要删除的下标");
				scanf("%d",&sub);
				del_sub(list,sub);
			}
			break;
		case 8:
			{
				datatype n;
				printf("请输入要查找的元素");
				scanf("%d",&n);
				int flag=find_data(list,n);
				if (flag == -1)
				{
					printf("查找的元素不存在\n");
				}
				else
				{
					printf("在%d下标出现\n",flag);
				}
			}
			break;
		case 9:
			{
				int key;
				datatype e;
				printf("请输入要插入其后的元素，并输入要插入的值：");
				scanf("%d %d",&key,&e);
				insert_num(list,key,e);
			}
			break;
		case 10:
			{
				datatype key;
				printf("请输入要删除的元素：");
				scanf("%d",&key);
				delete_data(list,key);

			}
			break;
		case 11:
			{
				int key;
				datatype e;
				printf("请输入要修改的元素与修改后的值：");
				scanf("%d %d",&key,&e);
				regets_data(list,key,e);
			}
			break;
		case 12:
			{
				bubble(list);
			}
			break;







		case 20:
			{
				free_space(list);
			}
			break;
		default:printf("输入错位，请重新输入您的选择\n");break;
		case 0:printf("退出程序\n");exit(0);
		
		}
	}
	return 0;
}