seqlist.cpp

王红梅编《数据结构》大多数的实验源码。内附详细的实验报告。

#include "SeqList.h"

template <class T>
SeqList<T>::SeqList(T a[], int n)
{
	if (n > MAX_SIZE)
		throw "上溢";
	length = n;
	for (int i = 0; i < n; i++)
		data[i] = a[i];
}

template <class T>
void SeqList<T>::Insert(int i, T x)
{
	if (length == MAX_SIZE)
		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++;
}

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

template <class T>
int SeqList<T>::Locate(T x)
{
	for (int i = 0; i < length; i++)
		if (data[i] == x)
			return i + 1;
	return 0;
}

template <class T>
void SeqList<T>::PrintList()
{
	for (int i = 0; i < length; i++)
		cout << data[i] << endl;
}