标题
2020数据结构与算法c++线性表的初始化
#include <iostream>
#include <cstdlib> // exit的头文件
#define MAXSIZE 100
using namespace std;
struct Student {
int StuID;
float score;
};
struct SqListStu{
Student *ElemStu; // 数组首元素的地址
int length; //定义数组的偏移量
};
//顺序表的初始化
void InitSqlist(SqListStu &SqLExp){
SqLExp.ElemStu=new Student[MAXSIZE];
if(SqLExp.ElemStu == NULL){ //判断地址是否申请成功
exit(0); // 申请地址失败
}
SqLExp.length = 0; // 申请地址成功,且此时地址长度初始化为0
};
int main(){
Student zhangsan;
zhangsan.StuID = 001;
zhangsan.score = 80;
SqListStu SqStu;
InitSqlist(SqStu);
cout << SqStu.length << endl;
return 0;
}