LinkList sortList(LinkList h)//排序后链表成为了无头链表
{
LinkList hn = NULL, p = NULL, q = NULL, pmin = NULL, qmin = NULL;
h = h->next;
while (h)
{
for (p = h, pmin = h; p; q = p, p = p->next)//循环找到链表中的最?值
{
if (p->data.score < pmin->data.score)
{
pmin = p;
qmin = q;
}
}
if (pmin == h)//如果最?值节点是头结点
{
h = h->next;//将该最?值节点从链表上移除
}
else
{
qmin->next = pmin->next;//将该最?值节点从链表上移除
}
//头插的?式创建?个新链表
pmin->next = hn;//将新节点头插到降序链表中
hn = pmin;//将原来的头结点指向现在的头结点
}
return hn;//返回降序链表的节点
}
