间接寻址的自我练习

//indirectaddresslinklist.h

#ifndef INDIRECTADDRESS
#define INDIRECTADDRESS
#include <iostream>
using std::cout;
using std::cin;
using std::endl;
const int Maxsize=50;
template <class T>
struct Node
{
	T data;
};
template <class T>
class IndirectAddress
{
public:
	IndirectAddress();
	IndirectAddress(T a[],int n);
	~IndirectAddress();
	T Get(int n);
	int Length(){return length;}
	int Locate(T x);
	void Printlist();
	void Insert(int n,T x);
	T Delete(int n);
private:
	Node<T>*address[Maxsize];
	int length;
};
template <class T>
IndirectAddress<T>::IndirectAddress()
{
	for(int i=0;i<Maxsize;i++)
		address[i]=NULL;
	length=0;
}
template <class T>
IndirectAddress<T>::IndirectAddress(T a[],int n)
{
	if(n>Maxsize) throw "error";
	for(int i=0;i<n;i++)
	{
		address[i]=new Node<T>;
		address[i]->data=a[i];
	}
	length=n;
}
template <class T>
void IndirectAddress<T>::Printlist()
{
	for(int i=0;i<length;i++)
		cout<<address[i]->data<<" ";
	cout<<endl;
}
template <class T>
void IndirectAddress<T>::Insert(int n,T x)
{
	if(n<=0||n>length+1) throw "error";
	for(int i=length;i>=n;i--)
		address[i]=address[i-1];
    address[n-1]=new Node<T>;
	address[n-1]->data=x;
	length++;
}
template <class T>
T IndirectAddress<T>::Delete(int n)
{
	if(n<=0||n>length) throw "error";
	Node<T>*q=address[n-1];
	int x=q->data;
	address[length]=NULL;
	for(int i=n;i<=length;i++)
		address[i-1]=address[i];
	delete q;
	length--;
	return x;
}
template <class T>
T IndirectAddress<T>::Get(int n)
{
	if(n<=0||n>length) throw "error";
	return address[n-1]->data;
}
template <class T>
int IndirectAddress<T>::Locate(T x)
{
	for(int i=0;i<length;i++)
		if(x==address[i]->data) return i+1;
	return 0;
}
template <class T>
IndirectAddress<T>::~IndirectAddress()
{
	cout<<"\n依次释放:\n";
	for(int i=0;i<length;i++)
	{
		delete address[i];
		cout<<"第"<<i+1<<"个元素";
		if((i+1)%5==0) cout<<endl;
	}
}
#endif

//main.cpp

#include "indirectaddresslinklist.h"
void main()
{
	int a[10]={10,1,2,3,4,5,6,7,8,9};
	IndirectAddress<int> i(a,10);
	cout<<"通过间接寻址的方法建立的线性表为：\n";
	i.Printlist();
	cout<<"长度为："<<i.Length()<<endl;
	cout<<"在第四个位置上插入10：\n";
	i.Insert(4,10);
	cout<<"插入后线性表为：\n";
	i.Printlist();
	cout<<"长度为："<<i.Length()<<endl;
	cout<<"把第四个位置上的元素删去，删除的元素为：";
	cout<<i.Delete(4)<<endl;
	cout<<"删除后线性表为：\n";
	i.Printlist();
	cout<<"线性表中第10个元素为："<<i.Get(10)<<endl<<endl;
	cout<<"线性表中2这个元素位于哪个位置上？(输出0代表不存在)\n"<<"第"<<i.Locate(2)<<"个位置"<<endl;
}

程序结果图：