顺序表的建立及基本操作
1.首先我们需要定义顺序表的结构体
//定义顺序表的结构体
typedef struct {
ElemType *elem; //顺序表元素
int length; //顺序表长度
int listsize; //顺序表大小
}Sqlist; //顺序表类型
2.初始化顺序表并置空
//初始化顺序表
Status InitList(Sqlist &L)
{
L.elem = (ElemType*)malloc(INIT_LIST_SIZE * sizeof(ElemType)); //申请堆空间
if (!L.elem)
return ERROR; //如果L不为空则报错
L.length = 0;
L.listsize = INIT_LIST_SIZE; //设置L的大小
return OK;
}
3.通过键盘给顺序表赋值并取出表中值
//取顺序表中的值
Status GetList(Sqlist &L)
{
int i;
printf("\n请输入顺序表元素:");
for ( i = 0; i < L.length; i++)
{
scanf("%d", &L.elem[i]);
}
printf("\n你所输入的元素为:");
for ( i = 0; i < L.length; i++)
{
printf("%d ", L.elem[i]);
}
printf("\n");
return OK;
}
找出最大值并输出其下标
//找出最大值并输出其下标
Status GetMax(Sqlist &L)
{
int i, temp = 0;
int max = L.elem[0];
for (i = 1; i < L.length; ++i)
{
if (max < L.elem[i])
{
max = L.elem[i];
temp = i;
}
}
printf("\n最大值是:%d\t在第%d个位置", max, temp + 1);
printf("\n");
return OK;
}
线性表的第m个元素前插入元素x
//在线性表的第m个元素前插入元素x
Status Insert(Sqlist &L, int m, int x)
{
int i;
for (i = L.length - 1; i >= m - 1; i--)
{
L.elem[i + 1] = L.elem[i];
}
L.elem[m - 1] = x;
L.length++;
return OK;
}
删除第k个元素
//删除第k个元素
Status Delete(Sqlist &L, int k)
{
int i;
for (i = k - 1; i < L.length; ++i)
{
L.elem[i] = L.elem[i + 1];
}
--L.length;
return OK;
}
排序
//排序
Status Sort(Sqlist L)
{
int i, j, temp;
for (i = 0; i < L.length - 1; i++)
{
for (j = 0; j < L.length - i - 1; j++)
{
if (L.elem[j] > L.elem[j + 1])
{
temp = L.elem[j];
L.elem[j] = L.elem[j + 1];
L.elem[j + 1] = temp;
}
}
}
return OK;
}
4.主函数调用
//主函数调用
int main()
{
//int i, n;
Sqlist L;
//首先初始化顺序表
InitList(L);
printf("请输入你所需创建的顺序表元素个数:");
scanf("%d", &L.length);
GetList(L);
return 0;
}
完整代码:
#include"顺序表操作头文件.h"
//创建一个空的顺序表
typedef struct {
ElemType *elem;
int length;
int listsize;
}Sqlist;
//初始化顺序表
Status InitList(Sqlist &L) {
L.elem = ((ElemType *)malloc(LIST_INIT_SIZE * sizeof(ElemType)));
if (!L.elem)
return ERROR;
L.length = 0;
L.listsize = LIST_INIT_SIZE;
return OK;
}
//取顺序表中的值
Status GetList(Sqlist &L)
{
int i;
printf("\n请输入线性表元素:");
for (i = 0; i < L.length; i++)
{
scanf("%d", &L.elem[i]);
}
printf("\n您输入的元素为:");
for (i = 0; i < L.length; i++)
{
printf("%d ", L.elem[i]);
}
printf("\n");
return OK;
}
//找出最大值并输出其下标
Status GetMax(Sqlist &L)
{
int i, temp = 0;
int max = L.elem[0];
for (i = 1; i < L.length; ++i)
{
if (max < L.elem[i])
{
max = L.elem[i];
temp = i;
}
}
printf("\n最大值是:%d\t在第%d个位置", max, temp + 1);
printf("\n");
return OK;
}
//在线性表的第m个元素前插入正整数x
Status Insert(Sqlist &L, int m, int x)
{
int i;
for (i = L.length - 1; i >= m - 1; i--)
{
L.elem[i + 1] = L.elem[i];
}
L.elem[m - 1] = x;
L.length++;
return OK;
}
//删除第k个元素
Status Delete(Sqlist &L, int k)
{
int i;
for (i = k - 1; i < L.length; ++i)
{
L.elem[i] = L.elem[i + 1];
}
--L.length;
return OK;
}
//排序
Status Sort(Sqlist L)
{
int i, j, temp;
for (i = 0; i < L.length - 1; i++)
{
for (j = 0; j < L.length - i - 1; j++)
{
if (L.elem[j] > L.elem[j + 1])
{
temp = L.elem[j];
L.elem[j] = L.elem[j + 1];
L.elem[j + 1] = temp;
}
}
}
return OK;
}
//主函数
int main()
{
int m, i, x, k;
Sqlist L;
InitList(L);
//printf("===================================\n");
printf("请输入要添加的元素个数:");
scanf("%d", &L.length);
GetList(L);
//获取最大值与其下标
printf("===================================\n");
GetMax(L);
printf("===================================\n");
//插入元素
printf("请输入在第几个位置前插入元素:");
scanf("%d", &m);
printf("\n");
printf("插入的元素是:");
scanf("%d", &x);
printf("\n");
Insert(L, m, x);
printf("在线性表的第m个元素前插入正整数x后的顺序表:\n");
printf("\n");
for (i = 0; i < L.length; ++i)
{
printf("%d ", L.elem[i]);
}
printf("\n");
printf("===================================\n");
//删除元素
printf("请输入删除第几个元素:");
scanf("%d", &k);
Delete(L, k);
for (i = 0; i < L.length; ++i)
{
printf("%d ", L.elem[i]);
}
printf("\n");
printf("===================================\n");
//排序
Sort(L);
for (i = 0; i < L.length; ++i)
{
printf("%d ", L.elem[i]);
}
printf("\n");
}
头文件
#pragma once
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define OK 1
#define ERROR 0
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
typedef int Status;
typedef int ElemType;