2024王道考研数据结构2.2.3综合应用题
有问题的可以一起评论区讨论,我也是刚学,希望大佬多多指出我的错误
- 头文件
#pragma once
#include<stdio.h>
#include<stdlib.h>
#define _CRT_SECURE_NO_WARNINGS
#define MaxSize 50
typedef int ElemType;
typedef struct {
ElemType data[MaxSize];
int length;
}SqList;
//初始化表
void InitList(SqList&);
//输出操作
void PrintList(SqList);
//求表长
int Length(SqList);
//判空操作
bool Empty(SqList);
//插入操作,第二个形参表示线性表位序,从1开始
bool ListInsert(SqList&, int, ElemType);
//删除操作,第二个形参表示线性表位序;第三个形参表示删除的元素
bool ListDelete(SqList&, int, ElemType&);
//按位查找操纵,第二个形参表示线性表位序
ElemType GetElem(SqList, int);
//按值查找操作,返回该值位序
int LocateElem(SqList, ElemType);
void InitList(SqList& L) {
for (int i = 0; i < MaxSize; i++) {
L.data[i] = 0;
}
L.length = 0;
}
void PrintList(SqList L) {
int length = Length(L);
if (length == 0) {
printf("空表!\n");
}
for (int i = 0; i < length; i++) {
printf("%d\t", L.data[i]);
}
}
int Length(SqList L) {
return L.length;
}
bool Empty(SqList L) {
return L.length == 0 ? true : false;
}
bool ListInsert(SqList& L, int i, ElemType e) {
int length = Length(L);
if (length == MaxSize) {
printf("表满!\n");
return false;
}
if (i < 1 || i> length + 1) {
printf("请输入正确的位序!\n");
return false;
}
for (int j = 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, ElemType& e) {
int length = Length(L);
if (length == 0) {
printf("空表!\n");
return false;
}
if (i < 1 || i > length) {
printf("请输入正确的位序!\n");
return false;
}
e = L.data[i - 1];
for (int j = i; j < length; j++) {
L.data[j - 1] = L.data[j];
}
L.length--;
return true;
}
ElemType GetElem(SqList L, int i) {
int length = Length(L);
if (length == 0) {
printf("空表!\n");
exit(0);
}
if (i < 1 || i > length) {
printf("请输入正确的位序!\n");
exit(0);
}
return L.data[i - 1];
}
int LocateElem(SqList L, ElemType e) {
int length = Length(L);
if (length == 0) {
printf("空表!\n");
return -1;
}
for (int i = 0; i < length; i++) {
if (L.data[i] == e) {
return i + 1;
}
}
return -1;
}
- code
#pragma once
#include<stdio.h>
#include<stdlib.h>
#define _CRT_SECURE_NO_WARNINGS
#define MaxSize 50
typedef int ElemType;
typedef struct {
ElemType data[MaxSize];
int length;
}SqList;
//初始化表
void InitList(SqList&);
//输出操作
void PrintList(SqList);
//求表长
int Length(SqList);
//判空操作
bool Empty(SqList);
//插入操作,第二个形参表示线性表位序,从1开始
bool ListInsert(SqList&, int, ElemType);
//删除操作,第二个形参表示线性表位序;第三个形参表示删除的元素
bool ListDelete(SqList&, int, ElemType&);
//按位查找操纵,第二个形参表示线性表位序
ElemType GetElem(SqList, int);
//按值查找操作,返回该值位序
int LocateElem(SqList, ElemType);
void InitList(SqList& L) {
for (int i = 0; i < MaxSize; i++) {
L.data[i] = 0;
}
L.length = 0;
}
void PrintList(SqList L) {
int length = Length(L);
if (length == 0) {
printf("空表!\n");
}
for (int i = 0; i < length; i++) {
printf("%d\t", L.data[i]);
}
}
int Length(SqList L) {
return L.length;
}
bool Empty(SqList L) {
return L.length == 0 ? true : false;
}
bool ListInsert(SqList& L, int i, ElemType e) {
int length = Length(L);
if (length == MaxSize) {
printf("表满!\n");
return false;
}
if (i < 1 || i> length + 1) {
printf("请输入正确的位序!\n");
return false;
}
for (int j = 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, ElemType& e) {
int length = Length(L);
if (length == 0) {
printf("空表!\n");
return false;
}
if (i < 1 || i > length) {
printf("请输入正确的位序!\n");
return false;
}
e = L.data[i - 1];
for (int j = i; j < length; j++) {
L.data[j - 1] = L.data[j];
}
L.length--;
return true;
}
ElemType GetElem(SqList L, int i) {
int length = Length(L);
if (length == 0) {
printf("空表!\n");
exit(0);
}
if (i < 1 || i > length) {
printf("请输入正确的位序!\n");
exit(0);
}
return L.data[i - 1];
}
int LocateElem(SqList L, ElemType e) {
int length = Length(L);
if (length == 0) {
printf("空表!\n");
return -1;
}
for (int i = 0; i < length; i++) {
if (L.data[i] == e) {
return i + 1;
}
}
return -1;
}