簡單實現順序表

//簡單順序表的實現 #include<iostream> #define MAXSIZE 10 #define OVERFLOW -2 using namespace std; typedef struct{ int *elem; int length; }Sqlist; bool InitList(Sqlist &L) { L.elem=new int[MAXSIZE]; if(

>>阅读原文<<