顺序表实现代码(c/c++/python)

C语言

--------------------------------------------------------------------------------------------------------

#include <stdio.h>
#include <stdlib.h>

typedef struct{
	int *data;
	int length;
	int size;
}seqList;

//初始化顺序表
int initList(seqList *L, int size);

//销毁顺序表
void destoryList(seqList *L);

//清空顺序表
void clearList(seqList *L);

int isEmpty(seqList L){
	return (L.length == 0);
}

//返回顺序表元素个数
int listLength(seqList L);

//返回顺序表最大元素个数
int listSize(seqList L); 

//返回元素 
int getElem(seqList L, int i, int *e); 

c++

-----------------------------------------------------------------------------------------

#include <iostream>
#include <cstdlib>
using namespace std;
class seqList{
	public:
		int *data;
		int length;
		int size;
		//初始化顺序表
		int initList(int size);
		
		//销毁顺序表
		void destoryList();
		
		//清空顺序表
		void clearList();
		
		int isEm