Sequential List
Basic knowledge
//Basic Data Structure Day1 Sequential List
//顺序表
#include <iostream>
using namespace std;
#define eleType int
struct SequentialList {//定义顺序表结构
eleType* elements;
int size; //顺序表当前的大小，元素的个数
int capacity; //顺序表的容量，就是数组的大小
};
void intializeList(SequentialList* list, int capacity) {//初始化顺序表
list->elements = new eleType[capacity];
list->size = 0;
list->capacity = capacity;
}
void destroyList(SequentialList* list) {//删除整个顺序表
delete[] list->elements;
}
int main() {
return 0;
}