#include<iostream>
const int MaxSize=1000;
using namespace std;
class CircList
{
public:
CircList();
void fun(int data[],int n,int m);
private:
int data[MaxSize];
int n;
int m;
};

怎么在类中实现线性表的动态存储啊?
即把上面的MaxSize作为一个动态值.

可以加一个增量呀:
#define INCREASE 10
data 不用数组, 改成指针
int *data;
初始化的时候给data分配MaxSize 个空间,
不够空间的时候给 data添加 INCREASE 个空间

if you want to make your list grow dynamically, you have to use dynamic memory allocation.

int data[MaxSize]; // this is static memeory allocation

In C++, you may use new and delete to to manage it; in C, you use malloc/realloc and free to magage it.