1.顺序表的实现
#include<iostream.h>
const int Maxsize=15;
class ScoreList
{
public:
void Insert(int i,int x);
int Delete(int i);
int Search(int x);
void Print();
ScoreList(){length=0;}
ScoreList(int a[],int n);
~ScoreList(){}
private:
int data[Maxsize];
int length;
};
ScoreList::ScoreList(int a[],int n)
{
if(n>Maxsize)throw"参数非法";
for(int i=0;i<n;i++)
data[i]=a[i];
length=n;
}
void ScoreList::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 ScoreList::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 ScoreList::Search(int x)
{
for(int i=0;i<length;i++)
if(data[i]==x)
return i+1;
}
void ScoreList::Print()
{
for(int i=0;i<length;i++)
cout<<"成绩:"<<data[i]<<" "<<endl;}
int main()
{
int b[5]={11,22,33,44,55};
ScoreList S(b,5);
cout<<"插入前数据为"<<endl;
S.Print();
cout<<"在第3个位置插入成绩为66的元素"<<endl;
S.Insert(3,66);
cout<<"现数据为"<<endl;
S.Print();
cout<<"删除第2个成绩"<<endl;
S.Delete(2);
cout<<"现数据为"<<endl;
S.Print();
cout<<"查找成绩为55的位置"<<endl;
cout<<S.Search(55)<<endl;
return 0;}
2.静态链表
#include<iostream.h>#include<string>
const int Maxsize = 100;
template<typename T>
class Node {
public:
T data;
int next; //存储指向下一个节点的数组下标
};
template <typename T>
class SLL {
public:
SLL();//无参构造函数
SLL(T score[],int n);//带参构造函数
virtual ~SLL();//空的析构函数
void print();//遍历操作
T get(int i);//按位查找操作
int Locate(T x);//按值查找操作
void insert(int i, T x);//插入操作
void Delete(int i);//删除操作
private:
Node<T> node[Maxsize];//节点
int first;
int avail;//指向空闲链的头指针
int length;//当前静态链表的长度
};
template<typename T>
SLL<T>::SLL(T score[],int n)
{
length = 0;
for(int i = 0; i<Maxsize; i++)
{
node[i].next=i+1;
}
node[Maxsize - 1].next = -1;
avail = 2;
first = 1;
node[first].next = -1;
for (int j = n-1; j >=0; j--)
{
if (avail == -1)
{
break;
}
int s = avail;
avail = node[avail].next;//空闲链的头指针后移
node[s].data = score[j];//将score[j]填入下标为S的节点
node[s].next = node[first].next;//将score[j]插到first后面
node[first].next = s;
length++;
}
}
template<class T>
SLL<T>::~SLL()
{
}
template<typename T>
void SLL<T>::print()
{
int s = node[first].next;
for (int i = 1; i <= length; i++)
{
cout << node[s].data << " ";
s = node[s].next;
}
}
template<typename T>
T SLL<T>::get(int i)
{
if(i<=0 || i>length) throw"位置非法";
int p = first;
for(int j = 0; j<i; j++)
{
p=node[p].next;
}
return node[p].data;
}
template<typename T>
int SLL<T>::Locate(T x)
{
int count=0;
int p = first;
while(node[p].next != -1)
{
p=node[p].next;
if(node[p].data == x) return count+1;
count++;
}
return -1;
}
template<typename T>
void SLL<T>::insert(int i, T x)
{
if(i<0||i>length) throw"位置非法";
int p = first;
for(int j = 1; j<i; j++)
{ p=node[p].next; }
int s = node[avail].next;
node[avail].data = x;
node[avail].next = node[p].next;
node[p].next = avail;
avail = s;
length++;
}
template<typename T>
void SLL<T>::Delete(int i)
{
if(i<0||i>length+1) throw"位置非法";
int p = first;
for(int j = 1;j<=i; j++)
{ p=node[p].next; }
int q = node[p].next;
T e = node[p].data;
node[p].next = node[q].next;
node[q].next = avail;
avail = q;
length--;
}
int main()
{
float score[8]={95,68,87,85,76,83,84,59};
SLL<float> student(score,8);
cout<<"学生英语成绩：";
student.print();
cout<<endl;
cout<<"在位置3插入成绩66"<<endl;
student.insert(3,66);
student.print();
cout<<endl;
cout<<"删除第六个成绩"<<endl;
student.Delete(5);
student.print();
cout<<endl;
cout<<"位置2的成绩为："<<student.get(2)<<endl;
cout<<"成绩83所在位置为："<<student.Locate(83)<<endl;
}