#include "list.h"
Plist create_list()
{
Plist L = malloc(sizeof(list));
if(NULL==L)
{
printf("申请空间失败\n");
return NULL;
}
L->len=0; // 长度初始化为0
printf("创建成功\n");
return L; //返回顺序表
}
//输入
int input_list(Plist L)
{
int n;
printf("要输入的学生个数");
scanf("%d", &n);
for(int i = 0;i<n;i++) //循环输入学生信息
{
printf("请输入第%d个学生信息\n", i+1);
printf("请输入学号:");
scanf("%d", &L->data[i].id);
printf("请输入姓名:");
scanf("%s", L->data[i].name);
printf("请输入专业:");
scanf("%s", L->data[i].major);
printf("请输入年龄:");
scanf("%d", &L->data[i].age);
L->len++;
}
return 0;
}
//输出
int output_list(Plist L)
{
int i;
for(i =0;i<L->len;i++)
{
printf("学号:%d\t姓名:%s\t专业:%s\t年龄:%d\n", L->data[i].id ,L->data[i].name,
L->data[i].major, L->data[i].age);
}
return 0;
}
//先判断数组是否满员
int full(Plist L)
{
if(L->len==MAX)
{
return 1;
}
return 0;
}
int insert_stu(Plist L,int pos,student e)
{
// 定义位置的下标
int sub = pos-1;
if(sub<0 || sub>L->len || L==NULL || full(L))
{
printf("插入失败");
return -1;
}
for(int i=L->len-1;i>=sub;i--)
{
L->data[i+1] = L->data[i];
}
L->data[sub] = e;
L->len++; //长度加一
printf("插入成功\n");
return 0;
}
//判断是否为空
int empty(Plist L)
{
if(L->len==0)
{
return 1;
}
return 0;
}
int delete_stu(Plist L,int pos)
{
int sub = pos-1;
if(sub<0 || sub>L->len-1 || L==NULL || empty(L))
{
printf("删除失败");
return -1;
}
for(int i=sub;i<L->len;i++)
{
L->data[i] = L->data[i+1];
}
L->len--; //长度减一
printf("删除成功\n");
return 0;
}
int inserach_stu(Plist L ,int pos)
{
int sub = pos -1;
if(sub<0 || sub>L->len-1 || L==NULL || empty(L))
{
printf("查找失败\n");
return -1;
}
printf("该学生存在\n");
printf("学号:%d\t姓名:%s\t专业:%s\t年龄:%d\n", L->data[sub].id ,L->data[sub].name,
L->data[sub].major, L->data[sub].age);
}
int change_stu(Plist L,int pos,student e)
{
int sub = pos -1;
if(sub<0 || sub>L->len-1 || L==NULL || empty(L))
{
printf("修改失败\n");
return -1;
}
L->data[sub]= e;
printf("修改成功\n");
return 0;
}
int insert_front(Plist L, student e)
{
if(L==NULL || full(L))
{
printf("插入失败\n");
}
for(int i=L->len-1 ;i>=0;i--)
{
L->data[i+1]= L->data[i];
}
L->data[0]= e;
L->len++;
printf("表头插入成功\n");
return 0;
}
int insert_rear(Plist L, student e)
{
if(L==NULL || full(L))
{
printf("表尾插入失败\n");
return -1;
}
L->data[L->len]= e;
L->len++;
printf("表尾插入成功\n");
return 0;
}
int delete_front(Plist L)
{
if(L==NULL || empty(L))
{
printf("表头删除失败\n");
return -1;
}
for(int i =0; i<L->len;i++)
{
L->data[i]= L->data[i+1];
}
L->len--;
printf("表头删除成功\n");
return 0;
}
int delete_rear(Plist L)
{
if(L==NULL || empty(L))
{
printf("表尾删除失败\n");
return -1;
}
L->data[L->len-1]= L->data[L->len];
L->len--;
printf("表尾删除成功\n");
return 0;
}
int delete_reverse(Plist L)
{
for(int i=0;i<L->len;i++)
{
for(int j=i+1;j<L->len;j++)
{
if(strcmp(L->data[i].name, L->data[j].name)==0)
{
delete_stu(L ,j+1);
j--;
}
}
}
return 0;
}
int find_stu(Plist L , char key[20])
{
int i , sub= -1 ;
for(i=0;i<L->len;i++)
{
if(strcmp(key,L->data[i].name)==0)
{
sub = i;
}
}
if(sub=-1)
{
return -1;
}
return sub+1;
}
int find_stu_all(Plist L,char key[20])
{
int i,sub=-1;
for(i=0;i<L->len;i++)
{
if(strcmp(key,L->data[i].name)==0)
{
printf("位置:%d\t是%s\n",i+1,L->data[i].name);
sub=i;
}
}
if(sub==1)
{
printf("查找失败,不存在该学生\n");
return -1;
}
return 0;
}
#include<myhead.h>
#include "list.h"
int main(int argc, const char *argv[])
{
Plist L = create_list();
int ch;
while(1)
{
printf("\t\t\t1、请输入学生信息\n");
printf("\t\t\t2、任意位置插入一个学生\n");
printf("\t\t\t3、任意位置删除一个学生\n");
printf("\t\t\t4、任意位置查找一个学生\n");
printf("\t\t\t5、任意位置修改一个学生\n");
printf("\t\t\t6、表头插入一个学生\n");
printf("\t\t\t7、表尾插入一个学生\n");
printf("\t\t\t8、表头删除一个学生\n");
printf("\t\t\t9、表尾删除一个学生\n");
printf("\t\t\t10、去除重复的学生\n");
printf("\t\t\t11、按照姓名查找学生返回位置\n");
printf("\t\t\t12、按照姓名查找学生并输出所有位置\n");
printf("请输入你的选择:");
scanf("%d",&ch);
switch(ch)
{
case 1:{
input_list(L);
output_list(L);
}
break;
case 2:
{student e = {10086,"细狗","物理", 21};
insert_stu(L,3,e);
output_list(L);}
break;
case 3:
{delete_stu(L,2);
output_list(L);}
break;
case 4:
{inserach_stu(L ,3);}
break;
case 5:
{student e1 = {10087,"黑狗","体育",23};
change_stu(L ,3, e1);
output_list(L);}
break;
case 6:
{student e2 = {9527,"舔狗","数学",21};
insert_front(L ,e2);
output_list(L);}
break;
case 7:
{student e2 = {9527,"舔狗","数学",21};
insert_rear(L,e2);
output_list(L);}
break;
case 8:
{delete_front(L);
output_list(L);}
break;
case 9:
{delete_rear(L);
output_list(L);}
break;
case 10:
{delete_reverse(L);
output_list(L);}
break;
case 11:
{int k= find_stu(L, "李华");
if(k==-1)
{
printf("查找失败\n");
}
else
{
printf("查找成功,该学生第%d个位置\n", k);
}
}
break;
case 12:
{find_stu_all(L,"李华");}
break;
default: printf("请输入正确的值\n");
break;
}
}
return 0;
}
#ifndef __H__
#define __H__
#include <myhead.h>
#define MAX 30
// 定义一个学生信息结构体
typedef struct
{
int id; //学号
char name[20]; //姓名
char major[20]; //专业
int age; //年龄
}student;
// 定义顺序结构体
typedef struct
{
student data[MAX]; //学生信息数组
int len; //学生个数
}list,*Plist;
/**********************函数声明**************************/
Plist create_list();
int input_list(Plist);
int output_list(Plist);
int full(Plist);
int insert_stu(Plist L ,int ,student );
int empty(Plist);
int delete_stu(Plist, int);
int inserach_stu(Plist , int);
int change_stu(Plist ,int , student);
int insert_front(Plist , student);
int insert_rear(Plist , student);
int delete_front(Plist);
int delete_rear(Plist);
int delete_reverse(Plist);
int find_stu(Plist, char *);
int find_stu_all(Plist ,char *);
#endif