#include<iostream>
#include<cassert>
using namespace std;
template<typename T>
class OrderList
{
public:
typedef struct _NODE
{
T value;
struct _NODE* next;
}NODE,*PNODE;
OrderList():pHead(NULL), size(0){}
OrderList(const OrderList&ref)
:pHead(NULL), size(0)
{
PNODE pPos = ref.pHead;
while (pPos != NULL)
{
this->InsertTail(pPos->value);
pPos = pPos->next;
}
}
OrderList& operator=(const OrderList&ref)
{
this->Clear();
PNODE pPos = ref.pHead;
while (pPos != NULL)
{
this->InsertTail(pPos->value);
pPos = pPos->next;
}
return *this;
}
~OrderList()
{
Clear();
}
bool isEmpty()
{
return NULL == pHead ? true : false;
}
void insert(const T& value)//采用双指针p1、p2,原理:将p2指向第一个大于value的数,p1指向p2的前驱,以便插入value
{
PNODE pNew = new NODE;
pNew->value = value;
PNODE p1 = NULL;
PNODE p2 = pHead;
w
根据链表类模板List,编写有序链表类模板OrderList,添加成员函数insert实现链表元素的有序(递增)插入。声明两个int类型的有序链表,分别插入5个元素,然后把b中的元素插入a中
最新推荐文章于 2022-10-28 19:55:19 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)