算法复习--------------基本算法：静态链表的实现

本文主要是介绍算法复习--------------基本算法：静态链表的实现，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

静态链表也叫模拟指针，采用一个节点数组以及对该数组进行索引的模拟指针来实现的

该数组中的每个元素都包含两个域，data和link，具体实现图跟链表差不多，就不给出图了，下面给出具体的实现代码

1.ClassSnode.h

#ifndef __imNode
#define __imNodetemplate<class T> class SimSpace;
template<class T> class SimChain;
template<class T>
class SimNode{friend SimSpace<T>;friend SimChain<T>;
private:T m_Data;int link; 
};#endif

2.ClassSimSpace.h

#ifndef SimSpace__
#define SimSpace__
#include<stdlib.h>
#include<iostream>
#include"ClassSnode.h"template<class T> class SimChain;template<class T>
class SimSpace{
private:int NumberOfNode, first;SimNode<T> *node; //节点数组friend SimChain<T>;
public:SimSpace(int MaxSpaceSize = 100);~SimSpace();int Allocate();void Deallocate(int &i);//删除节点 i};template<class T>
SimSpace<T>::~SimSpace(){}template<class T>
SimSpace<T>::SimSpace(int MaxSpaceSize){NumberOfNode = MaxSpaceSize;node = new SimNode<T>[NumberOfNode];//初始化空间表节点for (int i = 0; i < NumberOfNode; i++){node[i].link = i + 1;}node[NumberOfNode].link = -1;first = 0;
}template<class T>
int SimSpace<T>::Allocate(){//分配一个自由节点if (first == -1)throw;int i = first;first = node[i].link;return i;
}template<class T>
void SimSpace<T>::Deallocate(int &i){node[i].link = first;first = i;i = -1;
}
#endif

3.ClassSimChain.h

#ifndef SimChain__
#define SimChain__#include"ClassSimSpace.h"
#include<stdlib.h>
#include<iostream>using namespace std;
template<class T>
class SimChain{
private:int first;static SimSpace<T> s;
public:SimChain(){ first == -1; }~SimChain(){ Destory(); }void Destory(); //清除所有链表数据int Length()const;bool Find(int k, T& x)const;int Search(const T& x)const;SimChain<T>& Datele(int k, T& x);SimChain<T>& Insert(int l, const T& x);void OutPut(ostream& out)const;};template<class T>
void SimChain<T>::Destory(){//释放所有的链表节点int next;while (first != -1){next = s.node[first].link;s.Deallocate(first);first = next;}
}template<class T>
int SimChain<T>::Length()const{//返回链表中节点的数量int current = first;int len = 0;while (current != -1){current = s.node[current].link;len++;}return len;
}template<class T>
bool SimChain<T>::Find(int k, T& x)const{if (k < 1)return false;int current = first,index = 1;while (index < k && current != -1){current = s.node[current].link;index++;}if (current == -1){return false;}x = s.node[current].m_Data;return true;
}template<class T>
int SimChain<T>::Search(const T& x)const{int current = first,index = 1;while (current != -1 &&s.node[current].m_Data != x){current = s.node[current].link;index++;}return ((current > 0) ? index : 0);
}template<class T>
SimChain<T>& SimChain<T>::Datele(int k, T& x){if (k < 1 || first == -1) throw;int p = first;if (k == 1)first = s.node[first].link;else{int q = first;for (int index = 1; index < k - 1 && q != -1; index++){q = s.node[q].link;}if (q == -1 || s.node[q].link == -1){throw;}p = s.node[q].link;s.node[q].link = s.node[p].link;}x = s.node[p].m_Data;s.Deallocate(p);return *this;
}template<class T>
SimChain<T>& SimChain<T>::Insert(int k, const T& x){if (k < 0)throw;int p = first;for (int index = 1; index < k && p != -1; index++){p = s.node[p].link;}if (k > 0 && p == -1)throw;int y = s.Allocate();s.node[y].m_Data = x;if (k){s.node[y].link = s.node[p].link;s.node[p].link = y;}else{s.node[y].link = first;first = y;}return *this;
}template<class T>
void SimChain<T>::OutPut(ostream& out)const{for (int current = first; current != -1; current = s.node[current].link)out << s.node[current].m_Data << " ";
}template<class T>
ostream& operator<<(ostream& out, const SimChain<T>& x)
{x.OutPut(out);return out;
}#endif

4.具体使用

// Schain.cpp : 定义控制台应用程序的入口点。
//#include "stdafx.h"
#include"ClassSimChain.h"
#include<iostream>
using namespace std;SimSpace<int> SimChain<int>::s;int _tmain(int argc, _TCHAR* argv[])
{int x;SimChain<int> c;cout << "Chain length is" << c.Length() << endl;c.Insert(0, 2).Insert(1, 6);cout << "Chain length is" << c.Length() << endl;c.Find(1, x);cout << "first element is " << x << endl;c.Datele(1, x);cout << "Deleted " << x << endl;cout << "New length is " << c.Length() << endl;cout << "the Position of 6 is" << c.Search(6) << endl;c.Insert(0, 9).Insert(1, 8).Insert(2, 7);cout << "current chain is " << c << endl;cout << "the length of chain is " << c.Length() << endl;getchar();return 0;
}

5.输出结果：

Chain length is0
Chain length is2
first element is 2
Deleted 2
New length is 1
the Position of 6 is1
current chain is 9 8 7 6
the length of chain is 4

这篇关于算法复习--------------基本算法：静态链表的实现的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---