非循环双向链表增加访问频度域freq，每进行一次Locate（L，x）运算，freq加一。使链表中结点保持按访问频度非增的顺序排列，同时最近访问的结点排在频度相同的结点前面

最新推荐文章于 2024-09-11 22:16:58 发布

vivi_and_qiao

最新推荐文章于 2024-09-11 22:16:58 发布

阅读量1.7k

点赞数

分类专栏：数据结构与算法文章标签：非循环双向链表访问频度排序王道考研数据结构与算法

本文链接：https://blog.csdn.net/vivi_and_qiao/article/details/82784732

版权

数据结构与算法专栏收录该内容

67 篇文章 9 订阅

订阅专栏

typedef struct dnode20
{
    int data, fre;
    dnode20 *lnext, *rnext;
}Dnode20;

void printDnode20(Dnode20 *h)
{
    Dnode20 *p = h->rnext;
    while (p)
    {
        printf("%d  fre:%d    ", p->data, p->fre);
        p = p->rnext;
    }
}

Dnode20 *createDnode20link()//创建20题目要求的链表
{
    type x;
    Dnode20 *h, *t;
    t = h = (Dnode20 *)malloc(sizeof(Dnode20));
    h->rnext=h->lnext = NULL;

    scanf_s("%d", &x);
    while (x != -1)
    {
        Dnode20 *s = (Dnode20 *)malloc(sizeof(Dnode20));
        s->data = x;
        s->fre = 0;
        s->rnext = NULL;
        t->rnext = s;
        s->lnext = t;
        t = s;
        scanf_s("%d", &x);
    }
    t->rnext = NULL;
    printDnode20(h);
    return h;
}

Dnode20 *Locate20(Dnode20 *h,type x)
{
    Dnode20 *p=h;
    Dnode20 *q,*m;
    while (p->rnext&&p->rnext->data != x)
        p = p->rnext;
    if (!p->rnext)
        return NULL;
    ++(p->rnext->fre);
    q = p;
    m = p->rnext;
    p->rnext = m->rnext;
    if (m->rnext!=NULL)
    m->rnext->lnext = p;
    while (q!= h&&q->fre <= m->fre)
        q = q->lnext;
    q->rnext->lnext = m;
    m->rnext = q->rnext;
    m->lnext = q;
    q->rnext = m;
        /*q->rnext->lnext = m;
        p->rnext = m->rnext;
        m->lnext = q;
        if (m->rnext)
            m->rnext->lnext = p;
        m->rnext = q->rnext;
        q->rnext = m;*/
}