答案补充 晕还只能传一幅图 x){//从表头向后查找值为x的节点Node *p = L;while(p->data ||| 就按你所说的顺序写代码不就成了 一个IF 一个排序 LocateNode(L 修改下 建议程序自己多写写 = NULL) { //断开p在链表中的连接 p->prior->next = p->next; p->next->prior = p->prior; //新位置插入p pTmp->prior->next = p; p->prior = pTmp->prior; p->next = pTmp; pTmp->prior = p; } }else{ //在尾部插入新的节点 Node *pNewNode = new Node; p->next = pNewNode; pNewNode->prior = p; pNewNode->data = x; pNewNode->next = NULL; pNewNode->freq = 0; }} 答案补充 字数有限制贴图片给你 = NULL) { pTmp = pTmp->next; } //新的插入位置不是尾部 if (pTmp->next = NULL){ p = p->next;}//判断是否找到if (p->data == x){ p->freq += 1; //从头节点根据freq的值调节节点顺序 Node *pTmp = L; while (pTmp->freq > p->freq && pTmp->next = x && p->next 回答你这个问题可麻烦死了