循环链表是另一种形式的链式存贮结构。它的特点是表中最后一个结点的指针域指向头结点，整个链表形成一个环。
双向循环链表——在双链表中，将终端结点的下一个（Next）指针域NULL改为指向表头结点或开始结点，表头结点或开始结点的上一个（Pre）指针改为指向终端结点即可。
循环链表的特点是无须增加存储量，仅对表的链接方式稍作改变，即可使得表处理更加方便灵活。
注意：
①循环链表中没有NULL指针。涉及遍历操作时，其终止条件就不再是像非循环链表那样判别p或p->next是否为空，而是判别它们是否等于某一指定指针，如头指针或尾指针等。
②在单链表中，从一已知结点出发，只能访问到该结点及其后续结点，无法找到该结点之前的其它结点。而在单循环链表中，从任一结点出发都可访问到表中所有结点，这一优点使某些运算在单循环链表上易于实现。
链式存储结构
在计算机中用一组任意的存储单元存储线性表的数据元素(这组存储单元可以是连续的,也可以是不连续的).
它不要求逻辑上相邻的元素在物理位置上也相邻.因此它没有顺序存储结构所具有的弱点,但也同时失去了顺序表可随机存取的优点.
链式存储结构特点：
1、比顺序存储结构的存储密度小 (每个节点都由数据域和指针域组成，所以相同空间内假设全存满的话顺序比链式存储更多)。
2、逻辑上相邻的节点物理上不必相邻。
3、插入、删除灵活 (不必移动节点，只要改变节点中的指针)。
4、查找结点时链式存储要比顺序存储慢。
5、每个结点是由数据域和指针域组成。
以后的笔记潇汀会尽量详细讲解一些相关知识的，希望大家继续关注、支持、顶起我的博客。
你们的关注就是我的动力，本节笔记到这里就结束了。
潇汀一有时间就会把自己的学习心得，觉得比较好的知识点写出来和大家一起分享。
编程开发的路很长很长，非常希望能和大家一起交流，共同学习，共同进步。
如果文章中有什么疏漏的地方，也请大家留言指正。也希望大家可以多留言来和我探讨编程相关的问题。
最后，谢谢你们一直的支持~~~
------------------------------------------
Country: China
Tel: +86-152******41
QQ: 451292510
E-mail: xiaoting_chen2010@163.com
------------------------------------------
C++完整个代码示例（代码在VS2005下测试可运行）
AL_Node.h
/**
@(#)$Id: AL_Node.h 44 2013-09-13 08:50:04Z xiaoting $
@brief store data, and be used to AL_ListSingle, AL_ListDouble, AL_ListCircular and so on
Chain storage structure//
The computer using a set of arbitrary linear table storage unit stores data elements (which may be a continuous plurality of memory cells, it can be discontinuous).
It does not require the logic elements of adjacent physical location is adjacent to and therefore it is not sequential storage structure has a weakness, but also lost the sequence table can be accessed randomly advantages.
Chain store structural features:
1, compared with sequential storage density storage structure (each node consists of data fields and pointers domains, so the same space is full, then assume full order of more than chain stores).
2, the logic is not required on the adjacent node is physically adjacent.
3, insert, delete and flexible (not the mobile node, change the node as long as the pointer).
4, find the node when stored sequentially slower than the chain stores.
5, each node is a pointer to the data fields and domains.
@Author $Author: xiaoting $
@Date $Date: 2013-09-13 16:50:04 +0800 (周五, 13 九月 2013) $
@Revision $Revision: 44 $
@URL $URL: https://svn.code.sf.net/p/xiaoting/game/trunk/MyProject/AL_DataStructure/groupinc/AL_Node.h $
@Header $Header: https://svn.code.sf.net/p/xiaoting/game/trunk/MyProject/AL_DataStructure/groupinc/AL_Node.h 44 2013-09-13 08:50:04Z xiaoting $
*/
#ifndef CXX_AL_NODE_H
#define CXX_AL_NODE_H
///
// AL_Node
///
template<typename T> class AL_ListSingle;
template<typename T> class AL_ListDouble;
template<typename T> class AL_ListCircularSingle;
template<typename T> class AL_ListCircularDouble;
template<typename T> class AL_StackList;
template<typename T> class AL_QueueList;
template<typename T> class AL_QueuePriorityList;
template<typename T>
class AL_Node
{
public:
/**
* Destruction
*
* @param
* @return
* @note
* @attention
*/
~AL_Node();
protected:
private:
friend class AL_ListSingle<T>;
friend class AL_ListDouble<T>;
friend class AL_ListCircularSingle<T>;
friend class AL_ListCircularDouble<T>;
friend class AL_StackList<T>;
friend class AL_QueueList<T>;
friend class AL_QueuePriorityList<T>;
/**
* Construction
*
* @param
* @return
* @note private the Construction, avoid the others use it
* @attention
*/
AL_Node();
/**
* Construction
*
* @param const T& tTemplate <IN>
* @return
* @note
* @attention private the Construction, avoid the others use it
*/
AL_Node(const T& tTemplate);
public:
protected:
private:
T m_data; //the friend class can use it directly
AL_Node *m_pPre; //previous data AL_ListDouble will use it
AL_Node *m_pNext; //next data
};
///
// AL_Node
///
/**
* Construction
*
* @param
* @return
* @note private the Construction, avoid the others use it
* @attention
*/
template<typename T>
AL_Node<T>::AL_Node():
m_pPre(NULL),
m_pNext(NULL)
{
//memset(&m_data, 0x00, sizeof(T)); //can not use memset, as to pointer or virtural pointer of class
}
/**
* Construction
*
* @param const T& tTemplate <IN>
* @return
* @note
* @attention private the Construction, avoid the others use it
*/
template<typename T>
AL_Node<T>::AL_Node(const T& tTemplate):
m_data(tTemplate),
m_pPre(NULL),
m_pNext(NULL)
{
}
/**
* Destruction
*
* @param
* @return
* @note
* @attention
*/
template<typename T>
AL_Node<T>::~AL_Node()
{
//it doesn't matter to clear the pointer or not.
m_pPre = NULL;
m_pNext = NULL;
}
#endif // CXX_AL_NODE_H
/* EOF */
AL_ListCircularDouble.h
/**
@(#)$Id: AL_ListCircularDouble.h 44 2013-09-13 08:50:04Z xiaoting $
@brief Double-way circular list is another form of one-way linked list structure, which is characterized by a pointer to the list
of the last one is no longer a null value, but point to the head of the linked list. So long as we know any node in the linked list
can be found circulating list of all other nodes.
Also called double-linked list doubly linked list is a list in which each data node in both two pointers that point to a
direct successor and direct precursors. Therefore, two-way linked list from any one of the node point, can easily access its
predecessor and successor nodes node.
@Author $Author: xiaoting $
@Date $Date: 2013-09-13 16:50:04 +0800 (周五, 13 九月 2013) $
@Revision $Revision: 44 $
@URL $URL: https://svn.code.sf.net/p/xiaoting/game/trunk/MyProject/AL_DataStructure/groupinc/AL_ListCircularDouble.h $
@Header $Header: https://svn.code.sf.net/p/xiaoting/game/trunk/MyProject/AL_DataStructure/groupinc/AL_ListCircularDouble.h 44 2013-09-13 08:50:04Z xiaoting $
*/
#ifndef CXX_AL_LISTCIRCULARDOUBLE_H
#define CXX_AL_LISTCIRCULARDOUBLE_H
#ifndef CXX_AL_NODE_H
#include "AL_Node.h"
#endif
///
// AL_ListCircularDouble
///
template<typename T>
class AL_ListCircularDouble
{
public:
static const DWORD LISTDOUBLE_POSITION_INVALID = 0xffffffff;
/**
* Construction
*
* @param
* @return
* @note
* @attention
*/
AL_ListCircularDouble();
/**
* Destruction
*
* @param
* @return
* @note
* @attention
*/
~AL_ListCircularDouble();
/**
* Length
*
* @param VOID
* @return DWORD
* @note get the length of the list
* @attention
*/
DWORD Length() const;
/**
* Find
*
* @param const T& tTemplate <IN>
* @return DWORD
* @note find the position of tTemplate
* @attention if not find, will be return 0xffffffff
*/
DWORD Find(const T& tTemplate ) const;
/**
* IsElement
*
* @param const T& tTemplate <IN>
* @return BOOL
* @note the tTemplate is in the list?
* @attention
*/
BOOL IsElement(const T& tTemplate ) const;
/**
* Insert
*
* @param DWORD dwIndex <IN>
* @param const T& tTemplate <IN>
* @return BOOL
* @note inset the tTemplate into the list at the position
* @attention
*/
BOOL Insert(DWORD dwIndex,const T& tTemplate );
/**
* InsertBegin
*
* @param const T& tTemplate <IN>
* @return BOOL
* @note inset the tTemplate into the list at the position
* @attention
*/
BOOL InsertBegin(const T& tTemplate );
/**
* InsertEnd
*
* @param const T& tTemplate <IN>
* @return BOOL
* @note inset the tTemplate into the list at the position
* @attention
*/
BOOL InsertEnd(const T& tTemplate );
/**
* Remove
*
* @param const T& tTemplate <IN>
* @return BOOL
* @note remove the tTemplate into the list
* @attention
*/
BOOL Remove(const T& tTemplate );
/**
* IsEmpty
*
* @param VOID
* @return BOOL
* @note the list has data?
* @attention
*/
BOOL IsEmpty() const;
/**
* Get
*
* @param T& tTypeOut <OUT>
* @param DWORD dwIndex <IN>
* @return BOOL
* @note get the T at the position
* @attention the dwIndex must is little than the list length
*/
BOOL Get(T& tTypeOut, DWORD dwIndex) const;
/**
* Set
* @param T& tTypeOut <OUT>
* @param DWORD dwIndex <IN>
* @param const T& tTemplate <IN>
* @return BOOL
* @note Replaced with the element element element on position index, and returns the old element...
* @attention Index must in the list
*/
BOOL Set(T& tTypeOut, DWORD dwIndex, const T& tTemplate);
/**
* Clear
*
* @param VOID
* @return VOID
* @note clear the data in the list
* @attention all data will be clear
*/
VOID Clear();
protected:
private:
/**
* GetNodeByIndex
*
* @param DWORD dwIndex <IN>
* @return AL_Node<T>*
* @note get the const T& at the position
* @attention the dwIndex must is little than the list length
*/
AL_Node<T>* GetNodeByIndex(DWORD dwIndex) const;
public:
protected:
private:
AL_Node<T>* m_pHeader;
DWORD m_dwSize;
};
///
// AL_ListCircularDouble
///
/**
* Construction
*
* @param
* @return
* @note
* @attention
*/
template<typename T>
AL_ListCircularDouble<T>::AL_ListCircularDouble():
m_pHeader(NULL),
m_dwSize(0X00)
{
m_pHeader = new AL_Node<T>;
m_pHeader->m_pPre = m_pHeader;
m_pHeader->m_pNext = m_pHeader;
}
/**
* Destruction
*
* @param
* @return
* @note
* @attention
*/
template<typename T>
AL_ListCircularDouble<T>::~AL_ListCircularDouble()
{
Clear();
//delete the header
if (NULL != m_pHeader) {
delete m_pHeader;
m_pHeader = NULL;
}
}
/**
* Length
*
* @param
* @return DWORD
* @note get the length of the list
* @attention
*/
template<typename T> DWORD
AL_ListCircularDouble<T>::Length() const
{
return m_dwSize;
/*
if (TRUE == IsEmpty()) {
return 0;
}
AL_Node<T>* pMove = NULL;
DWORD dwCount = 1;
pMove = m_pHeader->m_pNext;
while (m_pHeader != pMove->m_pNext) {
dwCount ++;
pMove = pMove->m_pNext;
}
return dwCount;
*/
}
/**
* Find
*
* @param const T& tTemplate <IN>
* @return DWORD
* @note find the position of tTemplate
* @attention if not find, will be return 0xffffffff
*/
template<typename T> DWORD
AL_ListCircularDouble<T>::Find(const T& tTemplate ) const
{
if (TRUE == IsEmpty()) {
return LISTDOUBLE_POSITION_INVALID;
}
AL_Node<T>* pMove = NULL;
DWORD dwCount = 1;
//loop the next data;
pMove = m_pHeader->m_pNext;
while (m_pHeader != pMove->m_pNext) {
if (tTemplate == pMove->m_data) {
//find the data
return dwCount-1;
}
dwCount ++;
pMove = pMove->m_pNext;
}
//the end
if (tTemplate == pMove->m_data) {
//find the data
return dwCount-1;
}
return LISTDOUBLE_POSITION_INVALID;
}
/**
* IsElement
*
* @param const T& tTemplate <IN>
* @return BOOL
* @note the tTemplate is in the list?
* @attention
*/
template<typename T> BOOL
AL_ListCircularDouble<T>::IsElement(const T& tTemplate ) const
{
if (LISTDOUBLE_POSITION_INVALID == Find(tTemplate )) {
return FALSE;
}
return TRUE;
}
/**
* Insert
*
* @param DWORD dwIndex <IN>
* @param const T& tTemplate <IN>
* @return BOOL
* @note inset the tTemplate into the list at the position
* @attention
*/
template<typename T> BOOL
AL_ListCircularDouble<T>::Insert(DWORD dwIndex, const T& tTemplate )
{
if (dwIndex > Length()) {
//can not insert to this position
return FALSE;
}
AL_Node<T>* pInsert = new AL_Node<T>;
pInsert->m_data = tTemplate;
AL_Node<T>* pPre = NULL;
//get the previous Node
if (0x00 == dwIndex) {
pPre = m_pHeader;
}
else {
pPre = GetNodeByIndex(dwIndex - 1);
}
if ((NULL == pPre)) {
//error
return FALSE;
}
if (Length() == dwIndex){
//end
pPre->m_pNext = pInsert;
pInsert->m_pPre = pPre;
pInsert->m_pNext = m_pHeader;
m_pHeader->m_pPre = pInsert;
}
else {
//among of the list
AL_Node<T>* pIndexNode = pPre->m_pNext;
if ((NULL == pIndexNode)) {
//error
return FALSE;
}
pInsert->m_pNext = pIndexNode;
pIndexNode->m_pPre = pInsert;
pPre->m_pNext = pInsert;
pInsert->m_pPre = pPre;
}
m_dwSize++;
return TRUE;
}
/**
* InsertBegin
*
* @param const T& tTemplate <IN>
* @return BOOL
* @note inset the tTemplate into the list at the position
* @attention
*/
template<typename T> BOOL
AL_ListCircularDouble<T>::InsertBegin(const T& tTemplate )
{
return Insert(0, tTemplate);
}
/**
* InsertEnd
*
* @param const T& tTemplate <IN>
* @return BOOL
* @note inset the tTemplate into the list at the position
* @attention
*/
template<typename T> BOOL
AL_ListCircularDouble<T>::InsertEnd(const T& tTemplate )
{
return Insert(Length(), tTemplate);
}
/**
* Remove
*
* @param const T& tTemplate <IN>
* @return BOOL
* @note remove the tTemplate into the list
* @attention
*/
template<typename T> BOOL
AL_ListCircularDouble<T>::Remove(const T& tTemplate )
{
if (TRUE == IsEmpty()) {
return FALSE;
}
DWORD dwPosition = Find(tTemplate);
if (LISTDOUBLE_POSITION_INVALID == dwPosition) {
//can not find the data
return FALSE;
}
AL_Node<T>* pDelete = GetNodeByIndex(dwPosition);
if (NULL == pDelete) {
//error
return FALSE;
}
AL_Node<T>* pPre = NULL;
//get the previous Node
if (0x00 == dwPosition) {
pPre = m_pHeader;
}
else {
pPre = pDelete->m_pPre;
}
if (NULL == pPre) {
//error
return FALSE;
}
pPre->m_pNext = pDelete->m_pNext;
AL_Node<T>* pNext = pDelete->m_pNext;
if (NULL != pNext) {
//among of the list
pNext->m_pPre = pPre;
}
delete pDelete;
pDelete = NULL;
m_dwSize--;
return TRUE;
}
/**
* IsEmpty
*
* @param
* @return BOOL
* @note the list has data?
* @attention
*/
template<typename T> BOOL
AL_ListCircularDouble<T>::IsEmpty() const
{
return (m_pHeader == m_pHeader->m_pNext) ? TRUE:FALSE;
}
/**
* Get
*
* @param T& tTypeOut <OUT>
* @param DWORD dwIndex <IN>
* @return BOOL
* @note get the T at the position
* @attention the dwIndex must is little than the list length
*/
template<typename T> BOOL
AL_ListCircularDouble<T>::Get(T& tTypeOut, DWORD dwIndex) const
{
if (TRUE == IsEmpty()) {
//error
return FALSE;
}
if (Length()-1 < dwIndex) {
//error
return FALSE;
}
AL_Node<T>* pGet = GetNodeByIndex(dwIndex);
if (NULL == pGet) {
//error
return FALSE;
}
tTypeOut = pGet->m_data;
return TRUE;
/* //test code
if (TRUE == IsEmpty()) {
//error
return FALSE;
}
if (Length()-1 < dwIndex) {
//error
return FALSE;
}
AL_Node<T>* pGet = GetNodeByIndex(dwIndex);
if (NULL == pGet) {
//error
return FALSE;
}
AL_Node<T>* pStop = pGet;
while(pStop != pGet->m_pNext) {
if (pStop == pGet) {
//header no data
}
pGet = pGet->m_pNext;
}
return TRUE;
*/
}
/**
* Set
* @param T& tTypeOut <OUT>
* @param DWORD dwIndex <IN>
* @param const T& tTemplate <IN>
* @return BOOL
* @note Replaced with the element element element on position index, and returns the old element...
* @attention Index must in the list
*/
template<typename T> BOOL
AL_ListCircularDouble<T>::Set(T& tTypeOut, DWORD dwIndex, const T& tTemplate)
{
if (Length()-1 < dwIndex) {
//error
return FALSE;
}
AL_Node<T>* pSet = GetNodeByIndex(dwIndex);
if (NULL == pSet) {
//error
return FALSE;
}
tTypeOut = pSet->m_data;
pSet->m_data = tTemplate;
return TRUE;
}
/**
* Clear
*
* @param VOID
* @return VOID
* @note clear the data in the list
* @attention all data will be clear
*/
template<typename T> VOID
AL_ListCircularDouble<T>::Clear()
{
if (TRUE == IsEmpty()) {
//No data,
return;
}
AL_Node<T>* pDelete = NULL;
while(m_pHeader != m_pHeader->m_pNext){
//get the node
pDelete = m_pHeader->m_pNext;
m_pHeader->m_pNext = pDelete->m_pNext;
delete pDelete;
pDelete = NULL;
}
m_dwSize = 0x00;
}
/**
* GetNodeByIndex
*
* @param DWORD dwIndex <IN>
* @return AL_Node<T>*
* @note get the const T& at the position
* @attention the dwIndex must is little than the list length
*/
template<typename T> AL_Node<T>*
AL_ListCircularDouble<T>::GetNodeByIndex(DWORD dwIndex) const
{
if (Length()-1 < dwIndex) {
//error
return NULL;
}
AL_Node<T>* pMove = NULL;
DWORD dwCount = 1;
//loop the next data;
pMove = m_pHeader->m_pNext;
while (m_pHeader != pMove->m_pNext) {
if (dwCount-1 == dwIndex) {
//get this place
return pMove;
}
dwCount ++;
pMove = pMove->m_pNext;
}
//the end
return pMove;
/* //test code
//forward loop (only for test)
//get the end node
AL_Node<T>* pEnd = NULL;
pEnd = m_pHeader->m_pPre;
DWORD dwCount = Length();
//loop the next data;
AL_Node<T>* pMove = NULL;
pMove = pEnd;
while (m_pHeader != pMove->m_pPre) {
if (dwCount-1 == dwIndex) {
//get this place
return pMove;
}
dwCount --;
pMove = pMove->m_pPre;
}
//the end
return pMove;
*/
}
#endif // CXX_AL_LISTCIRCULARDOUBLE_H
/* EOF */
测试代码
#ifdef TEST_AL_LISTCIRCULARDOUBLE
AL_ListCircularDouble<DWORD> cListCircularDouble;
BOOL bEmpty = cListCircularDouble.IsEmpty();
std::cout<<bEmpty<<std::endl;
int array[15]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
for(int i=0;i<15;i++)
cListCircularDouble.Insert(cListCircularDouble.Length(), array[i]);
bEmpty = cListCircularDouble.IsEmpty();
std::cout<<bEmpty<<std::endl;
//test the interface
DWORD dwListSeqLen = cListCircularDouble.Length();
std::cout<<dwListSeqLen<<std::endl;
DWORD dwFind = cListCircularDouble.Find(16);
std::cout<<dwFind<<std::endl;
dwFind = cListCircularDouble.Find(12);
std::cout<<dwFind<<std::endl;
BOOL bElement = cListCircularDouble.IsElement(16);
std::cout<<bElement<<std::endl;
bElement = cListCircularDouble.IsElement(14);
std::cout<<bElement<<std::endl;
BOOL bInsert = cListCircularDouble.Insert(0, 0);
std::cout<<bInsert<<std::endl;
bInsert = cListCircularDouble.Insert(16, 16);
std::cout<<bInsert<<std::endl;
bInsert = cListCircularDouble.Insert(16, 999);
std::cout<<bInsert<<std::endl;
BOOL bRemove = cListCircularDouble.Remove(9846354);
std::cout<<bRemove<<std::endl;
bRemove = cListCircularDouble.Remove(999);
std::cout<<bRemove<<std::endl;
bRemove = cListCircularDouble.Remove(10);
std::cout<<bRemove<<std::endl;
DWORD it = 0x00;
for (DWORD i=0; i<cListCircularDouble.Length(); i++) {
cListCircularDouble.Get(it, i);
std::cout<<it<<std::endl;
}
DWORD dwSet = 0x00;
cListCircularDouble.Set(dwSet, 16, 999);
std::cout<<dwSet<<std::endl;
cListCircularDouble.Set(dwSet, 0, 888);
std::cout<<dwSet<<std::endl;
cListCircularDouble.Set(dwSet, 11, 777);
std::cout<<dwSet<<std::endl;
for (DWORD i=0; i<cListCircularDouble.Length(); i++) {
cListCircularDouble.Get(it, i);
std::cout<<it<<std::endl;
}
cListCircularDouble.Clear();
bEmpty = cListCircularDouble.IsEmpty();
std::cout<<bEmpty<<std::endl;
dwListSeqLen = cListCircularDouble.Length();
std::cout<<dwListSeqLen<<std::endl;
bInsert = cListCircularDouble.Insert(1, 999);
std::cout<<bInsert<<std::endl;
bInsert = cListCircularDouble.Insert(0, 666);
std::cout<<bInsert<<std::endl;
bRemove = cListCircularDouble.Remove(666);
std::cout<<bRemove<<std::endl;
bEmpty = cListCircularDouble.IsEmpty();
std::cout<<bEmpty<<std::endl;
dwListSeqLen = cListCircularDouble.Length();
std::cout<<dwListSeqLen<<std::endl;
#endif
扫一扫
2586
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
