数据结构之顺序表见解
顺序表的介绍:
顺序表是简单的一种线性结构,逻辑上相邻的数据在计算机内的存储位置也是相邻的,可以
快速定位第几个元素,中间不允许有空值,插入、删除时需要移动大量元素。
顺序表的三个要素(核心):
用 elems 记录存储位置的基地址
分配一段连续的存储空间 size
用 length 记录实际的元素个数,即顺序表的长度
结构体如何定义:
#define MAX_SIZE 100
struct _SqList{
ElemType *elems; // 顺序表的基地址 ElemType 定义的类型,可以为int等
int length; // 顺序表的长度
int size; // 顺序表总的空间大小
};
顺序表的初始化:
#include<iostream>
using namespace std;
#define MAX_SIZE 100
/*
typedef struct _SquList SqList;
struct _SqList{
int *elems;
int length;
int size;
};
*/
typedef struct {
int *elems; //顺序表的基地址
int length; //顺序表地长度
int size; //顺序表的空间大小
}SqList;
bool initList(SqList &L) //构造一个空的顺序表L
{
L.elems = new int[MAX_SIZE]; //为顺序表分配MAX_SIZE个int元素的空间
if (!L.elems) return false; //判断是否存储失败
L.length = 0; //创建的空表初始为0
L.size = MAX_SIZE;
return true;
}
void listPrint(SqList &L) {
cout << "顺序表存储空间size:" << L.size << ", 已保存的元素个数length:" << L.length << endl;
for (int i = 0; i <= L.length - 1;i++) {
cout << L.elems[i] << " ";
}
cout << endl;
}
int main() {
SqList list;
cout << "顺序表的初始化" << endl;
//1.初始化
if (initList(list)) {
cout << "顺序表初始化成功!" << endl;
}
listPrint(list);
system("pause");
return 0;
}
初始化的结果如下所示:
顺序表增加元素:
部分代码:
bool listAppend(SqList &L, int e) {
if(L.length==MAX_SIZE) return false; //存储空间已满
L.elems[L.length] = e;
L.length++; //表长增 1
return true;
}
完整代码:
#include<iostream>
using namespace std;
#define MAX_SIZE 100
/*
typedef struct _SquList SqList;
struct _SqList{
int *elems;
int length;
int size;
};
*/
typedef struct {
int *elems; //顺序表的基地址
int length; //顺序表地长度
int size; //顺序表的空间大小
}SqList;
bool initList(SqList &L) //构造一个空的顺序表L
{
L.elems = new int[MAX_SIZE]; //为顺序表分配MAX_SIZE个int元素的空间
if (!L.elems) return false; //判断是否存储失败
L.length = 0; //创建的空表初始为0
L.size = MAX_SIZE;
return true;
}
void listPrint(SqList &L) {
cout << "顺序表存储空间size:" << L.size << ", 已保存的元素个数length:" << L.length << endl;
for (int i = 0; i <= L.length - 1;i++) {
cout << L.elems[i] << " ";
}
cout << endl;
}
bool listAppend(SqList &L, int e) {
if (L.length == MAX_SIZE) return false; //存储空间已满
L.elems[L.length] = e;
L.length++; //表长增 1
return true;
}
int main() {
SqList list;
int e;
cout << "顺序表的初始化" << endl;
//1.初始化
if (initList(list)) {
cout << "顺序表初始化成功!" << endl;
}
//2.添加元素
int count = 0;
cout << "请输入要添加元素的个数:";
cin >> count;
for (int i = 0; i < count; i++) {
cout << endl;
cout << "请输入要添加的元素e:";
cin >> e;
if (listAppend(list, e)) {
cout << "添加成功!" << endl;
}else {
cout << "添加失败!" << endl;
}
}
listPrint(list);
system("pause");
return 0;
}
顺序表插入元素:
部分代码:
bool listInsert(SqList &L,int i, int e) {
if(i<0 || i>=L.length) return false; //i 值不合法
if(L.length==MAX_SIZE) return false; //存储空间已满
for(int j=L.length-1; j>=i; j--){
L.elems[j+1]=L.elems[j]; //从最后一个元素开始后移,直到第 i 个元素后移
}
L.elems[i]=e; //将新元素 e 放入第 i 个位置
L.length++; //表长增 1
return true;
}
完整代码:
#include<iostream>
using namespace std;
#define MAX_SIZE 100
typedef struct {
int *elems; //顺序表的基地址
int length; //顺序表地长度
int size; //顺序表的空间大小
}SqList;
bool initList(SqList &L) //构造一个空的顺序表L
{
L.elems = new int[MAX_SIZE]; //为顺序表分配MAX_SIZE个int元素的空间
if (!L.elems) return false; //判断是否存储失败
L.length = 0; //创建的空表初始为0
L.size = MAX_SIZE;
return true;
}
void listPrint(SqList &L) {
cout << "顺序表存储空间size:" << L.size << ", 已保存的元素个数length:" << L.length << endl;
for (int i = 0; i <= L.length - 1;i++) {
cout << L.elems[i] << " ";
}
cout << endl;
}
bool listAppend(SqList &L, int e) {
if (L.length == MAX_SIZE) return false; //存储空间已满
L.elems[L.length] = e;
L.length++; //表长增 1
return true;
}
bool listInsert(SqList &L, int i, int e) {
if (i < 0 || i >= L.length) return false; //i 值不合法
if (L.length == MAX_SIZE) return false; //存储空间已满
for (int j = L.length - 1; j >= i; j--) {
L.elems[j + 1] = L.elems[j]; //从最后一个元素开始后移,直到第 i 个元素后移
}
L.elems[i] = e; //将新元素 e 放入第 i 个位置
L.length++; //表长增 1
return true;
}
int main() {
SqList list;
int e;
int i;
cout << "顺序表的初始化" << endl;
//1.初始化
if (initList(list)) {
cout << "顺序表初始化成功!" << endl;
}
//2.添加元素
int count = 0;
cout << "请输入要添加元素的个数:";
cin >> count;
for (int i = 0; i < count; i++) {
cout << endl;
cout << "请输入要添加的元素e:";
cin >> e;
if (listAppend(list, e)) {
cout << "添加成功!" << endl;
}else {
cout << "添加失败!" << endl;
}
}
//3.插入元素
cout << "请输入要插入的位置和要插入的数据元素:";
cin >> i >> e;
if (listInsert(list, i, e)) {
cout << "插入成功!" << endl;
}else {
cout << "插入失败!" << endl;
}
listPrint(list);
system("pause");
return 0;
}
程序运行的控制台结果如下:
说明图如下:
顺序表删除元素:
部分代码:
bool listDelete(SqList &L,int i) {
if(i<0 || i>=L.length) return false; //不合法
if(i == L.length-1){//删除最后一个元素,直接删除 边界值
L.length--;
return true;
}
for (int j=i; j<L.length-1; j++){
L.elems[j] =L.elems[j+1]; //被删除元素之后的元素前移
}
L.length--;
return true;
}
完整代码:
#include<iostream>
using namespace std;
#define MAX_SIZE 100
typedef struct {
int *elems; //顺序表的基地址
int length; //顺序表地长度
int size; //顺序表的空间大小
}SqList;
bool initList(SqList &L) //构造一个空的顺序表L
{
L.elems = new int[MAX_SIZE]; //为顺序表分配MAX_SIZE个int元素的空间
if (!L.elems) return false; //判断是否存储失败
L.length = 0; //创建的空表初始为0
L.size = MAX_SIZE;
return true;
}
void listPrint(SqList &L) {
cout << "顺序表存储空间size:" << L.size << ", 已保存的元素个数length:" << L.length << endl;
for (int i = 0; i <= L.length - 1;i++) {
cout << L.elems[i] << " ";
}
cout << endl;
}
bool listAppend(SqList &L, int e) {
if (L.length == MAX_SIZE) return false; //存储空间已满
L.elems[L.length] = e;
L.length++; //表长增 1
return true;
}
bool listInsert(SqList &L, int i, int e) {
if (i < 0 || i >= L.length) return false; //i 值不合法
if (L.length == MAX_SIZE) return false; //存储空间已满
for (int j = L.length - 1; j >= i; j--) {
L.elems[j + 1] = L.elems[j]; //从最后一个元素开始后移,直到第 i 个元素后移
}
L.elems[i] = e; //将新元素 e 放入第 i 个位置
L.length++; //表长增 1
return true;
}
bool listDelete(SqList &L, int i) {
if (i < 0 || i >= L.length) return false; //不合法
if (i == L.length - 1) {//删除最后一个元素,直接删除 //边界值
L.length--;
return true;
}
for (int j = i; j < L.length - 1; j++) {
L.elems[j] = L.elems[j + 1]; //被删除元素之后的元素前移
}
L.length--;
return true;
}
int main() {
SqList list;
int e;
int i;
cout << "顺序表的初始化" << endl;
//1.初始化
if (initList(list)) {
cout << "顺序表初始化成功!" << endl;
}
//2.添加元素
int count = 0;
cout << "请输入要添加元素的个数:";
cin >> count;
for (int i = 0; i < count; i++) {
cout << endl;
cout << "请输入要添加的元素e:";
cin >> e;
if (listAppend(list, e)) {
cout << "添加成功!" << endl;
}else {
cout << "添加失败!" << endl;
}
}
listPrint(list);
//3.插入元素
cout << "请输入要插入的位置和要插入的数据元素:";
cin >> i >> e;
if (listInsert(list, i, e)) {
cout << "插入成功!" << endl;
}else {
cout << "插入失败!" << endl;
}
listPrint(list);
//4.删除元素
cout << "请输入要删除元素的位置:";
cin >> i;
if (listDelete(list, i)) {
cout << "删除成功!" << endl;
}else {
cout << "删除失败!" << endl;
}
listPrint(list);
system("pause");
return 0;
}
顺序表的销毁:
部分代码:
void destroyList(SqList &L) {
if (L.elems) delete []L.elems;//释放存储空间
L.length = 0;
L.size = 0;
}
全部完整代码:
#include<iostream>
using namespace std;
#define MAX_SIZE 100
typedef struct {
int *elems; //顺序表的基地址
int length; //顺序表地长度
int size; //顺序表的空间大小
}SqList;
bool initList(SqList &L) //构造一个空的顺序表L
{
L.elems = new int[MAX_SIZE]; //为顺序表分配MAX_SIZE个int元素的空间
if (!L.elems) return false; //判断是否存储失败
L.length = 0; //创建的空表初始为0
L.size = MAX_SIZE;
return true;
}
void listPrint(SqList &L) {
cout << "顺序表存储空间size:" << L.size << ", 已保存的元素个数length:" << L.length << endl;
for (int i = 0; i <= L.length - 1;i++) {
cout << L.elems[i] << " ";
}
cout << endl;
}
bool listAppend(SqList &L, int e) {
if (L.length == MAX_SIZE) return false; //存储空间已满
L.elems[L.length] = e;
L.length++; //表长增 1
return true;
}
bool listInsert(SqList &L, int i, int e) {
if (i < 0 || i >= L.length) return false; //i 值不合法
if (L.length == MAX_SIZE) return false; //存储空间已满
for (int j = L.length - 1; j >= i; j--) {
L.elems[j + 1] = L.elems[j]; //从最后一个元素开始后移,直到第 i 个元素后移
}
L.elems[i] = e; //将新元素 e 放入第 i 个位置
L.length++; //表长增 1
return true;
}
bool listDelete(SqList &L, int i) {
if (i < 0 || i >= L.length) return false; //不合法
if (i == L.length - 1) {//删除最后一个元素,直接删除 //边界值
L.length--;
return true;
}
for (int j = i; j < L.length - 1; j++) {
L.elems[j] = L.elems[j + 1]; //被删除元素之后的元素前移
}
L.length--;
return true;
}
void listDestroy(SqList &L) {
if (L.elems) delete[]L.elems;//释放存储空间
L.length = 0;
L.size = 0;
}
int main() {
SqList list;
int e;
int i;
cout << "顺序表的初始化" << endl;
//1.初始化
if (initList(list)) {
cout << "顺序表初始化成功!" << endl;
}
//2.添加元素
int count = 0;
cout << "请输入要添加元素的个数:";
cin >> count;
for (int i = 0; i < count; i++) {
cout << endl;
cout << "请输入要添加的元素e:";
cin >> e;
if (listAppend(list, e)) {
cout << "添加成功!" << endl;
}else {
cout << "添加失败!" << endl;
}
}
listPrint(list);
//3.插入元素
cout << "请输入要插入的位置和要插入的数据元素:";
cin >> i >> e;
if (listInsert(list, i, e)) {
cout << "插入成功!" << endl;
}else {
cout << "插入失败!" << endl;
}
listPrint(list);
//4.删除元素
cout << "请输入要删除元素的位置:";
cin >> i;
if (listDelete(list, i)) {
cout << "删除成功!" << endl;
}else {
cout << "删除失败!" << endl;
}
listPrint(list);
//5.销毁
listDestroy(list);
system("pause");
return 0;
}