1、交流的问题
2、单链表的另一个缺陷
— 单向性:只能从头结点开始高效访问链表中的数据元素
— 缺陷:如果需要逆向访问单链表中的数据元素将极其低效
3、新的线性表
设计思路:在“单链表”的结点中增加一个指针 pre,用于指向当前结点的前驱结点
双向链表的插入:
bool insert(int i, const T& e)
{
bool ret = (0 <= i && i <= m_length);
if(ret)
{
Node* node = create();
if(node != nullptr)
{
Node* current = position(i);
Node* next = current->next;
node->value = e;
node->next = next;
current->next = node;
if(current != reinterpret_cast<Node*>(&m_header)) //判断它不为头结点
{
node->pre = current;
}
else
{
node->pre = nullptr;
}
if(next != nullptr) //判断它不为空
{
next->pre = node;
}
m_length++;
}
else
{
THROW_EXCEPTION(NoEnoughMemoryException, "No memory to insert LinkList");
}
}
return ret;
}
双向链表的删除:
bool remove(int i)
{
bool ret = (0 <= i && i < m_length);
if(ret)
{
Node* current = position(i);
Node* toDel = current->next;
Node* next = toDel->next;
if(m_current == toDel)
{
m_current = next;
}
current->next = next;
if(next != nullptr)
{
next->pre = current;
}
m_length--;
destroy(toDel);
}
return ret;
}
4、双向链表的继承结构
程序:
DualLinkList.h
#ifndef DUALLINKLIST_H
#define DUALLINKLIST_H
#include "List.h"
#include "Exception.h"
namespace XiebsLib
{
template <typename T>
class DualLinkList : public List<T>
{
protected:
struct Node : public Object
{
T value;
Node* next;
Node* pre;
};
//mutable Node m_header;
mutable struct : public Object
{
char reserved[sizeof(T)];
Node* next;
Node* pre;
}m_header;
int m_length;
Node* m_current;
int m_step;
Node* position(int i)const
{
Node* ret = reinterpret_cast<Node*>(&m_header);
for(int p = 0; p < i; p++)
{
ret = ret->next;
}
return ret;
}
virtual Node* create()
{
return new Node;
}
virtual void destroy(Node* pn)
{
delete pn;
}
public:
DualLinkList()
{
m_header.next = nullptr;
m_header.pre = nullptr;
m_length = 0;
m_current = nullptr;
m_step = 1;
}
virtual bool move(int i, int step = 1)
{
bool ret = (0 <= i && i < m_length && step > 0);
if(ret)
{
m_current = position(i)->next;
m_step = step;
}
return ret;
}
virtual bool end()
{
return (m_current == nullptr);
}
virtual bool next()
{
int i = 0;
while(i < m_step && !end())
{
m_current = m_current->next;
i++;
}
return (i == m_step);
}
virtual bool pre()
{
int i = 0;
while(i < m_step && !end())
{
m_current = m_current->pre;
i++;
}
return (i == m_step);
}
virtual T current()
{
if(!end())
{
return m_current->value;
}
else
{
THROW_EXCEPTION(InvalidOperationException, "No value at current Position");
}
}
bool insert(int i, const T& e)
{
bool ret = (0 <= i && i <= m_length);
if(ret)
{
Node* node = create();
if(node != nullptr)
{
Node* current = position(i);
Node* next = current->next;
node->value = e;
node->next = next;
current->next = node;
if(current != reinterpret_cast<Node*>(&m_header))
{
node->pre = current;
}
else
{
node->pre = nullptr;
}
if(next != nullptr)
{
next->pre = node;
}
m_length++;
}
else
{
THROW_EXCEPTION(NoEnoughMemoryException, "No memory to insert LinkList");
}
}
return ret;
}
bool insert(const T& e)
{
return insert(m_length, e);
}
bool remove(int i)
{
bool ret = (0 <= i && i < m_length);
if(ret)
{
Node* current = position(i);
Node* toDel = current->next;
Node* next = toDel->next;
if(m_current == toDel)
{
m_current = next;
}
current->next = next;
if(next != nullptr)
{
next->pre = current;
}
m_length--;
destroy(toDel);
}
return ret;
}
bool set(int i, const T& e)
{
bool ret = (0 <= i && i < m_length);
if(ret)
{
position(i)->next->value = e;
}
return ret;
}
bool get(int i, T& e)const
{
bool ret = (0 <= i && i < m_length);
if(ret)
{
e = position(i)->next->value;
}
return ret;
}
virtual T get(int i)
{
T ret;
if(get(i, ret))
{
return ret;
}
else
{
THROW_EXCEPTION(IndexOutOfBoundsException, "Parameter i is Invalid");
}
}
int find(const T& e)const
{
int ret = -1;
int i = 0;
Node* node = m_header.next;
while(node != nullptr)
{
if(node->value == e)
{
ret = i;
break;
}
else
{
node = node->next;
i++;
}
}
return ret;
}
int length()const
{
return m_length;
}
void clear()
{
while(m_length > 0)
{
remove(0);
}
}
~DualLinkList()
{
clear();
}
};
}
#endif // DUALLINKLIST_H
main.cpp
#include <iostream>
#include "DualLinkList.h"
#include "Exception.h"
using namespace std;
using namespace XiebsLib;
int main()
{
DualLinkList<int> dl;
for(int i = 0; i < 5; i++)
{
dl.insert(0, i);
dl.insert(0, 5);
}
for(dl.move(0); !dl.end(); dl.next())
{
cout << dl.current() << endl;
}
cout << "begin" << endl;
// for(dl.move(dl.length()-1); !dl.end(); dl.pre())
// {
// cout << dl.current() << endl;
// }
dl.move(dl.length()-1);
while (!dl.end())
{
if(dl.current() == 5)
{
cout << dl.current() << endl;
dl.remove(dl.find(dl.current()));
}
else
{
dl.pre();
}
}
cout << "end" << endl;
for(dl.move(0); !dl.end(); dl.next())
{
cout << dl.current() << endl;
}
return 0;
}
小结
— 双向链表是为了弥补单链表的缺陷而重新设计的
— 在概念上,双向链表不是单链表,没有继承关系
— 双向链表中的游标能够直接访问当前结点的前驱和后继
— 双向链表是线性表概念的最终实现(更贴近理论的线性表)