顺序表操作:
head.h
#ifndef __HEAD_H__
#define __HEAD_H__
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
//定义枚举传递是否成功
enum
{
FALSE=-1,
SUCCESS
};
#define MAXSIZE 7
typedef int typedata;
typedef struct SQLIST
{
//顺序表数据元素
typedata data[MAXSIZE];
//顺序表长度
int len;
}sqlist;
int inster_element(typedata element,sqlist *p);
int full(sqlist *p);
int empty(sqlist *p);
sqlist* create();
int output(sqlist *p);
int delete_element();
void search_element(sqlist *p,int index);
void modify_element(sqlist *p,int index,typedata element);
void inster_index(sqlist *p,int index,typedata element);
void delete_index(sqlist*p,int index);
int search_key(sqlist*p,typedata key);
void delete_repeat(sqlist *p);
void element_modify(sqlist*p,typedata key,typedata element);
void element_delete(sqlist*p,typedata key);
void Bubble(sqlist*p);
sqlist* my_free(sqlist*p);
#endif
test.c
#include "head.h"
//申请堆区内存
sqlist* create()
{
sqlist* p=(sqlist *)malloc(sizeof(sqlist));
if(NULL==p)
return NULL;
//数据元素清0
memset(p->data,0,sizeof(p->data));
//顺序表长度清0
p->len=0;
return p;
}
//判断顺序表是否为满
int full(sqlist *p)
{
return p->len==MAXSIZE?FALSE:SUCCESS;
}
//判断是否为空
int empty(sqlist *p)
{
return p->len==0?FALSE:SUCCESS;
}
//尾插函数
int inster_element(typedata element,sqlist *p)
{
if(full(p) || NULL==p)
return FALSE;
p->data[p->len++]=element;
return SUCCESS;
}
//输出函数
int output(sqlist *p)
{
if(NULL==p || empty(p))
return FALSE;
//循环遍历
for(int i=0;i<p->len;i++)
{
printf("%-4d",p->data[i]);
}
puts("");
}
//尾删函数
int delete_element(sqlist *p)
{
if(NULL==p || empty(p))
return FALSE;
p->len--;
}
//按照下标查找
void search_element(sqlist *p,int index)
{
if(NULL==p || empty(p) || index<0 || index>=p->len)
return;
printf("the search_element is:%d\n",p->data[index]);
}
//按照下标修改
void modify_element(sqlist *p,int index,typedata element)
{
if(NULL==p || empty(p) || index<0 || index>=p->len)
return;
p->data[index]=element;
}
//按照下标插入
void inster_index(sqlist *p,int index,typedata element)
{
if(NULL==p || full(p) || index<0 || index>p->len)
return;
for(int i=p->len-1;i>=index;i--)
{
p->data[i+1]=p->data[i];
}
p->data[index]=element;
p->len++;
}
//按照下标删除
void delete_index(sqlist*p,int index)
{
if(NULL==p || empty(p) || index<0 || index>=p->len)
return;
for(int i=index+1;i<p->len;i++)
{
p->data[i-1]=p->data[i];
}
p->len--;
}
//按照元素查找
int search_key(sqlist*p,typedata key)
{
if(NULL==p || empty(p))
return FALSE;
int key_index=-1;
for(int i=0;i<p->len;i++)
{
if(key==p->data[i])
key_index=i;
}
return key_index;
}
//去重
void delete_repeat(sqlist *p)
{
for(int i=0;i<p->len-1;i++)
{
for(int j=i+1;j<p->len;j++)
{
if(p->data[i]==p->data[j])
{
delete_index(p,j);
j--;
}
}
}
}
//按任意元素修改
void element_modify(sqlist*p,typedata key,typedata element)
{
int a=search_key(p,key);
modify_element(p,a,element);
}
//按任意元素删除
void element_delete(sqlist*p,typedata key)
{
int a=search_key(p,key);
delete_index(p,a);
}
//顺序表排序
void Bubble(sqlist*p)
{
for(int i=1;i<p->len;i++)
{
for(int j=0;j<p->len-i;j++)
{
if(p->data[j]<p->data[j+1]){
typedata t=p->data[j];
p->data[j]=p->data[j+1];
p->data[j+1]=t;
}
}
}
}
//释放内存
sqlist* my_free(sqlist*p)
{
if(NULL==p)
return NULL;
free(p);
p=NULL;
return p;
}
main.c
#include "head.h"
int main(int argc, const char *argv[])
{
//在堆区创建顺序表
sqlist *p=create();
//循环调用尾插函数
typedata key;
int n;
int index;
typedata element;//插入的值
printf("please enter n:");
scanf("%d",&n);
for(int i=0;i<n;i++)
{
printf("please enter %d inster element:",i+1);
scanf("%d",&element);
int flag=inster_element(element,p);
if(flag==FALSE)
{
puts("NULL or FULL");
break;
}
}
output(p);
//尾删
delete_element(p);
delete_element(p);
output(p);
//按下标查找
printf("please enter index:");
scanf("%d",&index);
search_element(p,index);
//按照下标修改
printf("please enter element:");
scanf("%d",&element);
modify_element(p,index,element);
output(p);
//按照下标插入
printf("please enter index:");
scanf("%d",&index);
printf("please enter element:");
scanf("%d",&element);
inster_index(p,index,element);
output(p);
//按照下标删除
printf("please enter index:");
scanf("%d",&index);
delete_index(p,index);
output(p);
//按照元素查找
printf("please enter key:");
scanf("%d",&key);
int a=search_key(p,key);
printf("search_keyi=%d\n",a);
//去重
delete_repeat(p);
output(p);
//按元素修改
printf("please enter key:");
scanf("%d",&key);
a=search_key(p,key);
if(a!=-1){
printf("please enter element:");
scanf("%d",&element);
element_modify(p,key,element);
output(p);
}else{
puts("no key need to modify");
}
//按元素删除
printf("please enter key:");
scanf("%d",&key);
a=search_key(p,key);
if(a!=-1){
element_delete(p,key);
output(p);
}else{
puts("no key need to delete");
}
//顺序表排序
Bubble(p);
output(p);
//释放内存
p=my_free(p);
return 0;
}
顺序表按任意元素修改
函数代码:
//按任意元素修改
void element_modify(sqlist*p,typedata key,typedata element)
{
int a=search_key(p,key);
modify_element(p,a,element);
}
效果图:
顺序表按任意元素删除
函数代码:
//按任意元素删除
void element_delete(sqlist*p,typedata key)
{
int a=search_key(p,key);
delete_index(p,a);
}
效果图:
顺序表排序
函数代码:
//顺序表排序
void Bubble(sqlist*p)
{
for(int i=1;i<p->len;i++)
{
for(int j=0;j<p->len-i;j++)
{
if(p->data[j]<p->data[j+1]){
typedata t=p->data[j];
p->data[j]=p->data[j+1];
p->data[j+1]=t;
}
}
}
}
效果图:
顺序表释放空间
函数代码:
//释放内存
sqlist* my_free(sqlist*p)
{
if(NULL==p)
return NULL;
free(p);
p=NULL;
return p;
}