设计思路:定义一个指针pre=first;另一个指针curr=pre->link;比较pre->data和curr->data的大小,如果相等清除curr,不相等循环后移
template <class T>
void LinkedList<T>::Uniquify()
{
LinkNode<T> *curr, *pre = first;
if (pre == NULL)
return false;
curr = pre->link;
while (curr->link)
{
if(pre->data == curr->data)
{
del curr;
curr = pre->link;
}
curr = curr->link;
pre = pre->link;
}
return pre;
}