顺序表的实现

头文件源代码：

#ifndef Student_H
#define Student_H
const int Maxsize = 10;
class Student
{
public:
	Student(){ length = 0; }
	Student(int a[], int n);
	~Student(){}
	void Insert(int i, int x);
	int Delete(int i);
	int Locate(int x);
	void PrintList();
private:
	int data[Maxsize];
	int length;
};
#endif

成员函数源代码：

#include "head.h"
#include<iostream>
using namespace std;
Student::Student(int a[], int n)
{
	if (n > Maxsize)throw"参数非法";
	for (int i = 0; i < n; i++)
		data[i] = a[i];
	length = n;
}

void Student::Insert(int i, int x)
{
	if (length>Maxsize)throw"上溢";
	if (i<1 || i>length + 1)throw"位置非法";
	for (int j = length; j >= i; j--)
		data[j] = data[j - 1];
	data[i - 1] = x;
	length++;
}

int Student::Delete(int i)
{
	if (length == 0)throw"下溢";
	if (i<1 || i>length)throw"位置非法";
	int x = data[i - 1];
	for (int j = i; j<length; j++)
		data[j - 1] = data[j];
	length--;
	return x;
}

int Student::Locate(int x)
{
	for (int i = 0; i<length; i++)
	if (data[i] == x) return i + 1;
	return 0;
}

void Student::PrintList()
{
	for (int i = 0; i<length; i++)
		cout << data[i] << " ";
	cout << endl;
}

主函数源代码：

#include<iostream>
using namespace std;
#include "head.h"

void main()
{
	int r[5] = { 1, 2, 3, 4, 5 };
	Student L(r, 5);
	cout << "执行插入操作前的数据为：" << endl;
	L.PrintList();
	try
	{
		L.Insert(2, 3);
	}
	catch (char *s)
	{
		cout << s << endl;
	}
	cout << "执行插入操作后的数据为：" << endl;
	L.PrintList();
	cout << "值为3的元素位置为：";
	cout << L.Locate(3) << endl;
	cout << "执行删除第一个元素操作，删除前的数据为：" << endl;
	L.PrintList();
	try
	{
		L.Delete(1);
	}
	catch (char *s)
	{
		cout << s << endl;
	}
	cout << "删除后的数据为：" << endl;
	L.PrintList();
}