代码示例
#include <iostream>
using namespace std;
#define MAX 10
class sqList
{
public:
sqList();
~sqList();
bool InsertSqList(int post, int data);
void TraverseSqList();
bool isFull();
private:
int *head;
int length;
int last;
};
sqList::sqList()
{
head = new int[MAX];
if (!head)
{
exit(1);
}
length = 0;
last = -1;
cout << "构造ok" << endl;
}
sqList::~sqList()
{
delete[] head;
cout << "析构ok" << endl;
}
bool sqList::isFull()
{
return length == MAX;
}
bool sqList::InsertSqList(int post, int data)
{
if(isFull()||post < 0||post > MAX)
{
printf("post error\n");
return false;
}
for(int i = last;i >= post; i--)
{
head[i+1] = head[i];
}
head[post] = data;
last++;
length++;
}
void sqList::TraverseSqList()
{
for(int i = 0; i <= last; i++)
{
cout <<i <<" "<<head[i] <<endl;
}
}
int main()
{
sqList l;
l.InsertSqList(0, 1);
l.TraverseSqList();
return 0;
}
输出结果
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/f510def5b8b1aecebf4086adb22b824a.png)