线性表的基本操作

//VS2019里面跑   排序还没有做

 

 

 

 

# include<stdio.h>
# include<cstdlib>
# include<cstring>
# include<cmath>
# include<algorithm>
# include<iostream>
# define MaxSize 100
# define ElemType int
# define Status int

using namespace std;

typedef struct {
ElemType data[MaxSize];
int length;

}SqList;

Status InitList(SqList& L)
{
memset(L.data, 0, sizeof(L.data));
L.length = 0;
return 0;
}

bool CreatList(SqList& L, int n)
{
if (n < 0 || n > MaxSize)
return false;
for (int i = 0; i < n; i++)
{
scanf_s("%d", &L.data[i]);
L.length++;
}

return true;

}

bool ListInsert(SqList& L, int i, ElemType e)
{
if (i < 1 || i > MaxSize + 1)
{
printf("位置无效\n");
return false;
}

if (L.length >= MaxSize)
{
printf("空间已满\n");
return false;
}

for (int j = L.length; j >= i; j--)
{
L.data[j] = L.data[j - 1];

}

L.data[i - 1] = e;
L.length++;
return true;

}

bool ListDelete(SqList& L, int i)
{
if (i < 1 || i > L.length)
{
printf("位置无效\n");
return false;

}

for (int j = i; j <= L.length - 1; j++)
{
L.data[j - 1] = L.data[j];
}

L.length--;
return true;

}

int LocateElem(SqList L, ElemType e)
{
for (int i = 0; i < L.length; i++)
{
if (L.data[i] == e)
{
return i + 1;
}
}

return 0;

}

void PrintList(SqList L)
{
printf("当前顺序表的所有元素：\n");
for (int i = 0; i < L.length; i++)
{
printf("%d ", L.data[i]);

}

printf("\n");

}

void daoxu(SqList L)
{
printf("当前顺序表的所有元素倒置：\n");
for (int i = L.length-1; i >=0; i--)
{
printf("%d ", L.data[i]);

}

printf("\n");

}

void Creat(SqList& L)
{
int n;
bool flag;
L.length = 0;
printf("请输入要创建的顺序表长度：");
scanf_s("%d", &n);
printf("请输入%d个数", n);
flag = CreatList(L, n);
if (flag) {
printf("创建成功\n");
PrintList(L);
}else{
printf("长度不合法！\n");
}
}

void Insert(SqList& L)
{
int place;
ElemType e;
bool flag;
printf("请输入要插入的位置及元素：\n");
scanf_s("%d%d", &place, &e);
flag = ListInsert(L, place, e);
if (flag)
{
printf("插入成功\n");
PrintList(L);
}
else{
printf("插入不成功！\n");
}
}

void Delete(SqList& L)
{
int place;
bool flag;

printf("请输入要删除的位置：");
scanf_s("%d", &place);
flag = ListDelete(L, place);
if (flag)
{
printf("删除成功！\n");
}
else{
printf("删除不成功！\n");
}
}

void Search(SqList L)
{
ElemType e;
int flag;

printf("请输入你要查找的元素：");
scanf_s("%d", &e);
flag = LocateElem(L, e);
if (flag)
{
printf("该元素的位置为：%d\n", flag);
}else{
printf("未能找到该元素\n");
}
}

void menu()
{
printf("*******1.创建 2.插入*******\n");
printf("*******3.删除 4.查找*******\n");
printf("*******5.倒置 6.分奇偶排序*\n");
printf("*******7.输出 8.退出*******\n");
}

int main(void)
{
SqList L;
int choice;

while (1)
{
menu();
printf("请填写菜单序号！");
scanf_s("%d", &choice);
if (choice == 8){
break;
}
switch (choice)
{
case 1: Creat(L); break;
case 2: Insert(L); break;
case 3: Delete(L); break;
case 4: Search(L); break;
case 5: daoxu(L); break;
case 7: PrintList(L); break;
default: printf("输入错误\n");
}

}

return 0;
}