一、思維導圖

二、實現順序表的功能代碼

head.h

#ifndef __HEAD_H__
#define __HEAD_H__#include <stdio.h>
#include <string.h>
#include <stdlib.h>
//數組的最大長度
#define MAXSIZE 5enum type
{FALUSE=-1,//用于失敗返回的SUCCESS//用于成功返回的
};
//給數據元素的類型起別名
typedef int datatype;
//定義順序表的結構體
//
typedef struct sqlist
{//數據元素datatype data[MAXSIZE];//順序表長度:實際的元素個數 int len;
}*sqlist;//創建順序表
sqlist create_sqlist();
//尾部插入
int insert_rear(sqlist list,datatype element);
//循環輸出
int output(sqlist list);
//尾刪
int delate_rear(sqlist list);
//按下標查找
int search_index(sqlist list,datatype index);
//按下標刪除
int delate_index(sqlist list,datatype index);
//按下標修改
int change_index(sqlist list,int index,int element);
//按下標插入
int insert_index(sqlist list,int index,int element);
//去重
int de_weight(sqlist list);
//順序表排序
int sort(sqlist list);
//按元素查找
int search_yuansu(sqlist list,int number);
//按元素刪除
int delate_yuansu(sqlist list,int number);
//按元素修改
int change_yuansu(sqlist list,int number,int element);#endif

test.c

#include "head.h"//順序表內存申請
sqlist create_sqlist()
{sqlist list=(sqlist)malloc(sizeof(struct sqlist));if(NULL==list){return NULL;}//堆區內存申請成功//對數據元素清0bzero(list->data,sizeof(list->data));//對順序表長度清0list->len=0;//返回順序表return list;
}//順序表尾部插入
int insert_rear(sqlist list,datatype element)
{//1.判斷順序表是否為滿//2.判斷順序表是否為NULLif(NULL==list||list->len==MAXSIZE){printf("sqlist full..\n");return FALUSE;}//3.在順序表尾部插入list->data[list->len]=element;list->len++;return SUCCESS;
}//循環打印順序表
int output(sqlist list)
{//1.判斷順序表是否為空//2.判斷順序表是否為NULLif(list==NULL||list->len==0){printf("output error...\n");return FALUSE;}//循環輸出for(int i=0;i<list->len;i++){printf("%d\t",list->data[i]);}putchar(10);
}//尾刪
int delate_rear(sqlist list)
{//判斷順序表是否為空//判斷順序表是否為NULLif(list==NULL||list->len==0){printf("delate_rear error..\n");return FALUSE;}//刪除list->len--;return SUCCESS;
}//按下標查找
int search_index(sqlist list,datatype index)
{//判斷順序表是否為空//判斷順序表是否為NULLif(list==NULL||list->len==0||index<0||index>=list->len){printf("search_index error...\n");return FALUSE;}//輸出查找的值printf("%d\n",list->data[index]);return SUCCESS;
}//按下標刪除
int delate_index(sqlist list,datatype index)
{//判斷順序表是否為空//判斷順序表是否為NULL//判斷是否在順序表空間內if(list==NULL||list->len==0||index<0||index>=list->len){printf("delate_index error...\n");return FALUSE;}for(int i=index;i<list->len;i++){list->data[i]=list->data[i+1];}list->len--;return SUCCESS;
}//按下標修改
int change_index(sqlist list,int index,int element)
{//判斷順序表是否為空//判斷順序表是否為NULL//判斷是否在順序表空間內if(list==NULL||list->len==0||index<0||index>=list->len){printf("change_index error...\n");return FALUSE;}list->data[index]=element;return SUCCESS;
}//按下標插入
int insert_index(sqlist list,int index,int element)
{//判斷順序表是否為NULL//判斷是否在順序表空間內if(list==NULL||index<0||index>list->len){printf("insert_index error...\n");return FALUSE;}if(list->len==MAXSIZE){printf("內存已滿無法插入\n");return FALUSE;}list->len++;for(int i=list->len;i>index;i--){list->data[i-1]=list->data[i-2];}list->data[index]=element;return SUCCESS;
}//去重
int de_weight(sqlist list)
{//判斷順序表是否為空//判斷順序表是否為NULLif(list==NULL||list->len==0){printf("de_weight error..\n");return FALUSE;}for(int i=0;i<list->len;i++){for(int j=i+1;j<list->len;j++){if(list->data[i]==list->data[j]){delate_index(list,j);j--;}}}return SUCCESS;
}//順序表排序
int sort(sqlist list)
{//判斷順序表是否為空//判斷順序表是否為NULLif(list==NULL||list->len==0){printf("sort error..\n");return FALUSE;}for(int i=0;i<list->len-1;i++){for(int j=0;j<list->len-i-1;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;}}}return SUCCESS;
}//按元素查找
int search_yuansu(sqlist list,int number)
{//判斷順序表是否為空//判斷順序表是否為NULLif(list==NULL||list->len==0){printf("sort error..\n");return FALUSE;}for(int index=0;index<list->len;index++){if(list->data[index]==number){return index;}}return FALUSE;
}
//按元素刪除
int delate_yuansu(sqlist list,int number)
{//判斷順序表是否為空//判斷順序表是否為NULLif(list==NULL||list->len==0){printf("delate_yuansu error..\n");return FALUSE;}int index=search_yuansu(list,number);delate_index(list,index);return SUCCESS;
}
//按元素修改
int change_yuansu(sqlist list,int number,int element)
{	//判斷順序表是否為空//判斷順序表是否為NULLif(list==NULL||list->len==0){printf("change_yuansu error..\n");return FALUSE;}int index=search_yuansu(list,number);change_index(list,index,element);return SUCCESS;
}

main.c

#include "head.h"
int main(int argc, const char *argv[])
{//1.定義一個順序表sqlist list=create_sqlist();datatype element;//2.順序表尾部插入for(int i=0;i<MAXSIZE;i++){printf("請輸入一個值:");scanf("%d",&element);insert_rear(list,element);}//3.循環打印順序表 output(list);//4.尾部刪除delate_rear(list);delate_rear(list);printf("尾刪之后;");output(list);//5.按下標查找	int index;printf("輸入要查找的下標的值:");scanf("%d",&index);search_index(list,index);//6.按下標修改printf("輸入要修改的下標:");scanf("%d",&index);printf("輸入要改成的值:");scanf("%d",&element);change_index(list,index,element);output(list);//7.按下標刪除printf("輸入要刪除值的下標:");scanf("%d",&index);delate_index(list,index);output(list);//8.按下標插入printf("輸入要插入值的下標:");scanf("%d",&index);printf("輸入要插入的值:");scanf("%d",&element);insert_index(list,index,element);//9.去重0de_weight(list);printf("去重后的結果:");output(list);//10.順序表排序sort(list);printf("順序表排序后的結果:");output(list);//11.按元素查找index=search_yuansu(list,14);printf("元素查找的下標:");printf("%d\n",index);//12.按元素刪除delate_yuansu(list,14);printf("按元素刪除后的結果:");output(list);//13.按元素修改change_yuansu(list,14,54);printf("按元素修改后的結果:");output(list);//14.順序表釋放內存free(list);list=NULL;return 0;
}