#include "DoublyLinkedList.cpp"
#include <iostream>
using namespace std;
int main()
{
int r[5] = {1, 2, 3, 4, 5};
DoublyLinkedList<int> L(r, 5);
cout << "链表长度:" << L.Length() << endl;
cout << "执行插入操作前数据为:" << endl;
L.PrintList();
try
{
L.Insert(2, 3);
}
catch (const char *s)
{
cout << s << endl;
}
cout << "执行插入操作后数据为:" << endl;
L.PrintList();
cout << "值为5的元素位置为:";
cout << L.Locate(5) << endl;
cout << "执行删除操作前数据为:" << endl;
L.PrintList();
try
{
L.Delete(1);
}
catch (const char *s)
{
cout << s << endl;
}
cout << "执行删除操作后数据为:" << endl;
L.PrintList();
return 0;
}
#ifndef _DOUBLYLINKEDLIST_H
#define _DOUBLYLINKEDLIST_H 1
template <class DataType>
struct Node
{
DataType data;
Node<DataType> *prev, *next;
};
template <class DataType>
class DoublyLinkedList
{
public:
DoublyLinkedList();
DoublyLinkedList(DataType a[], int n);
~DoublyLinkedList();
int Locate(DataType x);
void Insert(int i, DataType x);
DataType Delete(int i);
void PrintList();
int Length();
private:
Node<DataType> *first, *last;
int length;
};
#endif
#include "DoublyLinkedList.h"
#include <iostream>
using namespace std;
template <typename DataType>
DoublyLinkedList<DataType>::DoublyLinkedList()
{
first = new Node<DataType>, last = new Node<DataType>;
first->prev = last->next = NULL;
first->next = last;
last->prev = first;
length = 0;
}
template <typename DataType>
DoublyLinkedList<DataType>::DoublyLinkedList(DataType a[], int n)
{
first = new Node<DataType>, last = new Node<DataType>;
first->prev = last->next = NULL;
first->next = last;
last->prev = first;
Node<DataType> *p = first, *s;
for (int i = 0; i < n; i++)
s = new Node<DataType>{a[i], p, NULL}, p->next = s, p = s;
p->next = last;
last->prev = p;
length = n;
}
template <typename DataType>
DoublyLinkedList<DataType>::~DoublyLinkedList()
{
for (Node<DataType> *p = first->next; p; p = p->next)
delete p->prev;
delete last;
}
template <typename DataType>
int DoublyLinkedList<DataType>::Locate(DataType x)
{
int cnt = 1;
for (Node<DataType> *p = first->next; p != last; p = p->next, cnt++)
if (p->data == x)
return cnt;
return 0;
}
template <typename DataType>
void DoublyLinkedList<DataType>::Insert(int i, DataType x)
{
if (i <= 0 || i > length)
throw "位置";
Node<DataType> *p = first->next, *pre = first;
i--;
for (int j = 0; j < i; j++)
pre = p, p = p->next;
Node<DataType> *s = new Node<DataType>{x, pre, p};
pre->next = p->prev = s;
length++;
}
template <typename DataType>
DataType DoublyLinkedList<DataType>::Delete(int i)
{
if (i <= 0 || i > length)
throw "位置";
i--;
Node<DataType> *p = first->next, *pre = first;
for (int j = 0; j < i; j++)
pre = p, p = p->next;
DataType ans = p->data;
pre->next = p->next;
p->next->prev = pre;
delete p;
length--;
return ans;
}
template <typename DataType>
void DoublyLinkedList<DataType>::PrintList()
{
for (Node<DataType> *p = first->next; p != last; p = p->next)
cout << p->data << " ";
cout << endl;
}
template <typename DataType>
int DoublyLinkedList<DataType>::Length() { return length; }