4,链表和函数指针结合
4,1输出(可以转换输出任意类型的数据)
typedef int Data;
typedef void (*PFUNC)(Node*);
void transfrom(DuList* list,PFUNC func)
{
if (empty(list))
{
return;
}
Node* curNode = list->front->next;
while (curNode!=list->front)
{
func(curNode);
curNode = curNode->next;
}
}
void print(Node* node)
{
printf("%d ", node->data);
}
transfrom(list, print);
4.2排序(控制升降)
typedef bool (*CMPARE)(Node* a,Node* b);
void sort(DuList* list, CMPARE cmp)
{
if (empty(list))
{
return;
}
for (Node* i = list->front->next; i->next!= list->front; i=i->next)
{
for (Node* k = list->front->next; k->next != list->front; k = k->next)
{
if (cmp(k,k->next))
{
Data t = k->data;
k->data = k->next->data;
k->next->data = t;
}
}
}
}
bool less(Node* a, Node* b)
{
return a->data < b->data;
}
bool grade(Node* a, Node* b)
{
return a->data > b->data;
}
sort(list,less);