9.13作业

思维导图

头文件

#ifndef __HEAD_H__
#define __HEAD_H__
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define MAXSIZE 10

//定义顺序表结构体;数据元素，顺序表长度
typedef struct sqlist
{
//数据元素
       int data[MAXSIZE];
//顺序表长度
       int len;
}sqlist;

int full_sqlist(sqlist*list);
int insert_rear(sqlist*list,int element);
sqlist*create();
int output(sqlist*list);
int delete_rear(sqlist*list);
int chazhao(sqlist*list,int sub);
int charu(sqlist*list,int k,int element);
int xiugai(sqlist*list,int l,int element);
#endif

函数

#include"head.h"



sqlist*create()
{
	sqlist *list=(sqlist*)malloc(sizeof(sqlist));
	if(NULL==list)
	{
	return NULL;
	}
	
	//对数据元素清0
	memset(list->data,0,sizeof(list->data)); 
	//顺序表长度清零0
	list->len=0;
	return list;
}
int full_sqlist(sqlist*list)
{
return list->len==MAXSIZE?-1:0;

}

int insert_rear(sqlist*list,int element)
{
//如果顺序满了，插入失败
//如果list指针为null插入失败
    if(NULL==list || full_sqlist(list))
	{
	  puts("错误");
	  return -1;
	}
	//插入
	list->data[list->len]=element;
	list->len++;
	return 0;

}
int output(sqlist*list)

{  if(NULL==list||full_sqlist(list))
	{
	puts("错误");
	return -1;

	}
   for(int i=0;i<list->len;i++)
   {
   printf("%d\t",list->data[i]);
   }
   puts("");
}

int delete_rear(sqlist*list)
{
   if(NULL==list||full_sqlist(list))
     {
	 puts("错误");
	 return -1;
     }
   list->len--;
   return 0;
}
int chazhao(sqlist*list,int sub)
	
{
  if(NULL==list||full_sqlist(list)||sub<0||sub>=list->len)
  {
  puts("错误");
  return -1;
  }
  printf("查找的元素%d",list->len);
}

int charu(sqlist*list,int k,int element)
{
  if(NULL==list||full_sqlist(list)||k<0||k>list->len)
  {
  puts("错误");
  return -1;
  }
   for(int i=list->len-1;i>k;i--)
   {
        list->data[i+1]=list->data[i];//后移
   }
   list->data[k]=element;
   printf("%d",list->data[k]);
}
int xiugai(sqlist*list,int l,int element)
{

	if(NULL==list||full_sqlist(list)||l<0||l>=list->len)
  {
  puts("错误");
  return -1;
  }
	list->data[l]=element;
	printf("%d",list->data[l]);
}

主函数

#include"head.h"
int main(int argc, const char *argv[])
{
	sqlist*list=create();
	//尾插：一次只能插入一个
	int n;//插入n个数
	int element;//输入的数据元素
    printf("请输入个数n");
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
	printf("请输入数据元素%d",i+1);
	scanf("%d",&element);
	//调用尾插函数
	insert_rear(list,element);
	}
output(list);
delete_rear(list);
delete_rear(list);
output(list);
int sub;
printf("输入下标");
scanf("%d",&sub);
chazhao(list,sub);
//插入
int k;//插入下标
printf("输入插入下标");
scanf("%d",&k);
printf("输入插入的值");
//int element;
scanf("%d",&element);
charu(list,k,element);
//修改
int l;//输入修改值的下标
printf("输入修改值的下标");
scanf("%d",&l);
printf("输入修改值");
scanf("%d",&element);
xiugai(list,l,element);

	return 0;
}