資料結構實驗三靜態連結串列學生資訊
阿新 • • 發佈:2018-11-21
#include<iostream>
#include<string>
using namespace std;
//靜態連結串列的儲存結構
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; /*或者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--;
}
void main()
{
double score[5]={95.7,68.2,37.8,84.5,76.5};
SLL<double> student(score,5);
cout<<" 學生資料結構成績"<<endl;
student.print();
cout<<endl<<endl<<"在位置3插入成績66,結果如下:"<<endl;
student.insert(3,66);
student.print();
cout<<endl<<endl<<"在位置4刪除成績 刪除後結果如下:"<<endl;
student.Delete(3);
student.print();
cout<<endl<<endl<<"位置2的成績為:"<<student.get(2)<<endl;
cout<<endl<<endl<<"成績68.2所在位置為:"<<student.Locate(68.2)<<endl;
}
#include<string>
using namespace std;
//靜態連結串列的儲存結構
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; /*或者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--;
}
void main()
{
double score[5]={95.7,68.2,37.8,84.5,76.5};
SLL<double> student(score,5);
cout<<" 學生資料結構成績"<<endl;
student.print();
cout<<endl<<endl<<"在位置3插入成績66,結果如下:"<<endl;
student.insert(3,66);
student.print();
cout<<endl<<endl<<"在位置4刪除成績 刪除後結果如下:"<<endl;
student.Delete(3);
student.print();
cout<<endl<<endl<<"位置2的成績為:"<<student.get(2)<<endl;
cout<<endl<<endl<<"成績68.2所在位置為:"<<student.Locate(68.2)<<endl;
}