数据结构课上学来的,代码修改了很久,给大家做个参考吧
- 头文件
#pragma once
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define OVERFLOW -2
#define MAXSIZE 100
typedef int Status;
typedef int ElemType; //自己决定
typedef struct
{
ElemType* elem;//存储空间的基地址
int length;//当前长度
int listsize;//当前分配的存储容量
}SqList;
2.实现
#include<bits/stdc++.h>
#include"add.h"
using namespace std;
Status Initlist(SqList& L) {
L.elem = new ElemType[MAXSIZE];
if (!L.elem) exit(OVERFLOW);
L.length = 0;
return OK;
}
bool CreateList(SqList& L, int n) {
if (n<0 || n>MAXSIZE) return FALSE;
printf("please enter the numbers;");
for (int i = 0; i < n; i++) {
scanf("%d", &L.elem[i]);
L.length++;
}
return TRUE;
}
void PrintElem(SqList L) {
printf("The SqList is:");
for (int i = 0; i < L.length; i++) {
printf("%d ", L.elem[i]);
}
}
Status Getelem(SqList L, int i, ElemType& e) {
if (i<1 || i>L.length) return ERROR;
e = L.elem[i - 1];
return OK;
}
int LocateElem(SqList L, ElemType e) {
for (int i = 0; i < L.length; i++) {
if (L.elem[i] == e) return i + 1;
}
return 0;
}
Status ListInsert(SqList& L, int i, ElemType e) {
if (i < 1 || i > (L.length + 1)) return ERROR;
if (L.length == MAXSIZE) return ERROR;
for (int j = L.length - 1; j >= i - 1; j--)
L.elem[j + 1] = L.elem[j];
L.elem[i - 1] = e;
++L.length;
return OK;
}
Status ListDelete(SqList& L, int i) {
if (i < 1 || i > L.length) {
printf("位置无效!\n");
return ERROR;
}
for (int j = i; j <= L.length - 1; j++)
L.elem[j - 1] = L.elem[j];
--L.length;
return OK;
}
int main(){
SqList L;
ElemType a,b,c;
Initlist(L);
CreateList(L, 7);//创建大小为7的顺序表
PrintElem(L);
printf("\n--------取出位置为?的元素给a变量--------\n");
scanf("%d", &b);
Getelem(L, b, a);
printf("a = % d", a);
printf("\n--------?元素所在顺序表位置为--------\n");
scanf("%d", &b);
LocateElem(L, b);
printf("%d", LocateElem(L, b));
printf("\n--------插入?在第?个位置--------\n");
scanf("%d%d", &c,&b);
ListInsert(L, b, c);
printf("\n--------插入元素后的顺序表为--------\n");
for (int i = 0; i < L.length; i++) {
printf("%d ", L.elem[i]);
}
printf("\n--------删除第?个元素:--------\n");
scanf("%d", &b);
ListDelete(L, b);
printf("\n--------删除元素后的顺序表为--------\n");
for (int i = 0; i < L.length; i++) {
printf("%d ", L.elem[i]);
}
return 0;
}