单链表
#ifndef __SINGLE_LIST_H__ #define __SINGLE_LIST_H__ #include <assert.h> #include <crtdbg.h> #ifdef _DEBUG #define DEBUG_NEW new (_NORMAL_BLOCK, THIS_FILE, __LINE__) #endif #ifdef _DEBUG #define new DEBUG_NEW #undef THIS_FILE static char THIS_FILE[] = __FILE__; #endif #ifdef _DEBUG #ifndef ASSERT #define ASSERT assert #endif #else // not _DEBUG #ifndef ASSERT #define ASSERT #endif #endif // _DEBUG template<typename T> class CNode { public: T data; CNode<T> *next; CNode() : data(T()), next(NULL) {} CNode(const T &initdata) : data(initdata), next(NULL) {} CNode(const T &initdata, CNode<T> *p) : data(initdata), next(p) {} }; template<typename T> class CSList { protected: int m_nCount; CNode<T> *m_pNodeHead; public: CSList(); CSList(const T &initdata); ~CSList(); public: int IsEmpty() const; int GetCount() const; int InsertBefore(const int pos, const T data); int InsertAfter(const int pos, const T data); int AddHead(const T data); int AddTail(const T data); void RemoveAt(const int pos); void RemoveHead(); void RemoveTail(); void RemoveAll(); T& GetTail(); T GetTail() const; T& GetHead(); T GetHead() const; T& GetAt(const int pos); T GetAt(const int pos) const; void SetAt(const int pos, T data); int Find(const T data) const; }; template<typename T> inline CSList<T>::CSList() : m_nCount(0), m_pNodeHead(NULL) { } template<typename T> inline CSList<T>::CSList(const T &initdata) : m_nCount(0), m_pNodeHead(NULL) { AddHead(initdata); } template<typename T> inline CSList<T>::~CSList() { RemoveAll(); } template<typename T> inline int CSList<T>::IsEmpty() const { return 0 == m_nCount; } template<typename T> inline int CSList<T>::AddHead(const T data) { CNode<T> *pNewNode; pNewNode = new CNode<T>; if (NULL == pNewNode) return 0; pNewNode->data = data; pNewNode->next = m_pNodeHead; m_pNodeHead = pNewNode; ++m_nCount; return 1; } template<typename T> inline int CSList<T>::AddTail(const T data) { return InsertAfter(GetCount(), data); } // if success, return the position of the new node. // if fail, return 0. template<typename T> inline int CSList<T>::InsertBefore(const int pos, const T data) { int i; int nRetPos; CNode<T> *pTmpNode1; CNode<T> *pTmpNode2; CNode<T> *pNewNode; pNewNode = new CNode<T>; if (NULL == pNewNode) { nRetPos = 0; goto Exit0; } pNewNode->data = data; // if the list is empty, replace the head node with the new node. if (NULL == m_pNodeHead) { pNewNode->next = NULL; m_pNodeHead = pNewNode; nRetPos = 1; goto Exit1; } // is pos range valid? ASSERT(1 <= pos && pos <= m_nCount); // insert before head node? if (1 == pos) { pNewNode->next = m_pNodeHead; m_pNodeHead = pNewNode; nRetPos = 1; goto Exit1; } // if the list is not empty and is not inserted before head node, // seek to the pos of the list and insert the new node before it. pTmpNode1 = m_pNodeHead; for (i = 1; i < pos; ++i) { pTmpNode2 = pTmpNode1; pTmpNode1 = pTmpNode1->next; } pNewNode->next = pTmpNode1; pTmpNode2->next = pNewNode; nRetPos = pos; Exit1: ++m_nCount; Exit0: return nRetPos; } // if success, return the position of the new node. // if fail, return 0. template<typename T> inline int CSList<T>::InsertAfter(const int pos, const T data) { int i; int nRetPos; CNode<T> *pTmpNode; CNode<T> *pNewNode; pNewNode = new CNode<T>; if (NULL == pNewNode) { nRetPos = 0; goto Exit0; } pNewNode->data = data; // if the list is empty, replace the head node with the new node. if (NULL == m_pNodeHead) { pNewNode->next = NULL; m_pNodeHead = pNewNode; nRetPos = 1; goto Exit1; } // is pos range valid? ASSERT(1 <= pos && pos <= m_nCount); // if the list is not empty, // seek to the pos of the list and insert the new node after it. pTmpNode = m_pNodeHead; for (i = 1; i < pos; ++i) { pTmpNode = pTmpNode->next; } pNewNode->next = pTmpNode->next; pTmpNode->next = pNewNode; nRetPos = pos + 1; Exit1: ++m_nCount; Exit0: return nRetPos; } template<typename T> inline int CSList<T>::GetCount() const { return m_nCount; } template<typename T> inline void CSList<T>::RemoveAt(const int pos) { ASSERT(1 <= pos && pos <= m_nCount); int i; CNode<T> *pTmpNode1; CNode<T> *pTmpNode2; pTmpNode1 = m_pNodeHead; // head node? if (1 == pos) { m_pNodeHead = m_pNodeHead->next; goto Exit1; } for (i = 1; i < pos; ++i) { // we will get the previous node of the target node after // the for loop finished, and it would be stored into pTmpNode2 pTmpNode2 = pTmpNode1; pTmpNode1 = pTmpNode1->next; } pTmpNode2->next = pTmpNode1->next; Exit1: delete pTmpNode1; --m_nCount; } template<typename T> inline void CSList<T>::RemoveHead() { ASSERT(0 != m_nCount); RemoveAt(1); } template<typename T> inline void CSList<T>::RemoveTail() { ASSERT(0 != m_nCount); RemoveAt(m_nCount); } template<typename T> inline void CSList<T>::RemoveAll() { int i; int nCount; CNode<T> *pTmpNode; nCount = m_nCount; for (i = 0; i < nCount; ++i) { pTmpNode = m_pNodeHead->next; delete m_pNodeHead; m_pNodeHead = pTmpNode; } m_nCount = 0; } template<typename T> inline T& CSList<T>::GetTail() { ASSERT(0 != m_nCount); int i; int nCount; CNode<T> *pTmpNode = m_pNodeHead; nCount = m_nCount; for (i = 1; i < nCount; ++i) { pTmpNode = pTmpNode->next; } return pTmpNode->data; } template<typename T> inline T CSList<T>::GetTail() const { ASSERT(0 != m_nCount); int i; int nCount; CNode<T> *pTmpNode = m_pNodeHead; nCount = m_nCount; for (i = 1; i < nCount; ++i) { pTmpNode = pTmpNode->next; } return pTmpNode->data; } template<typename T> inline T& CSList<T>::GetHead() { ASSERT(0 != m_nCount); return m_pNodeHead->data; } template<typename T> inline T CSList<T>::GetHead() const { ASSERT(0 != m_nCount); return m_pNodeHead->data; } template<typename T> inline T& CSList<T>::GetAt(const int pos) { ASSERT(1 <= pos && pos <= m_nCount); int i; CNode<T> *pTmpNode = m_pNodeHead; for (i = 1; i < pos; ++i) { pTmpNode = pTmpNode->next; } return pTmpNode->data; } template<typename T> inline T CSList<T>::GetAt(const int pos) const { ASSERT(1 <= pos && pos <= m_nCount); int i; CNode<T> *pTmpNode = m_pNodeHead; for (i = 1; i < pos; ++i) { pTmpNode = pTmpNode->next; } return pTmpNode->data; } template<typename T> inline void CSList<T>::SetAt(const int pos, T data) { ASSERT(1 <= pos && pos <= m_nCount); int i; CNode<T> *pTmpNode = m_pNodeHead; for (i = 1; i < pos; ++i) { pTmpNode = pTmpNode->next; } pTmpNode->data = data; } template<typename T> inline int CSList<T>::Find(const T data) const { int i; int nCount; CNode<T> *pTmpNode = m_pNodeHead; nCount = m_nCount; for (i = 0; i < nCount; ++i) { if (data == pTmpNode->data) return i + 1; pTmpNode = pTmpNode->next; } return 0; } #endif
测试程序
#include <iostream> #include "slist.h" using namespace std; int main() { int i; int nCount; CSList<int> slist; #ifdef _DEBUG _CrtSetDbgFlag(_CRTDBG_ALLOC_MEM_DF | _CRTDBG_LEAK_CHECK_DF); #endif slist.InsertAfter(slist.InsertAfter(slist.AddHead(1), 2), 3); slist.InsertAfter(slist.InsertAfter(slist.GetCount(), 4), 5); slist.InsertAfter(slist.GetCount(), 6); slist.AddTail(10); slist.InsertAfter(slist.InsertBefore(slist.GetCount(), 7), 8); slist.SetAt(slist.GetCount(), 9); slist.RemoveHead(); slist.RemoveTail(); // print out elements nCount = slist.GetCount(); for (i = 0; i < nCount; ++i) cout << slist.GetAt(i + 1) << endl; }
版权声明: