链表 4：（双链表的一个用途）访问频度调整

设有一个双链表，每个节点中除了有prior，data，和next三个域之外，还有一个访问频度域freq，在链表
被启用之前，其值均初始化为零。每当进行localnode（head，x）运算是，令元素值为x的节点中freq域的值加1，并调整节点的次序，使其按访问频度的递减排列，以便使频繁访问的节点总是靠近表头。

 

 

 #include <stdio.h> #include <stdlib.h> typedef char datatype; typedef unsigned cnttype; typedef struct node{ cnttype freq; /*表示访问频度*/ datatype data; /*节点数据*/ struct node *prior; struct node *next; }node; /*头插法建立链表*/ node *make_chain (datatype *string) { node *head; node *temp; cnttype i; head = (node *)calloc(1, sizeof(node)); head->next = NULL; head->prior = NULL; for (i = 0; string[i]; i++) { temp = (node *)calloc(1, sizeof(node)); temp->data = string[i]; temp->freq = 0; /*访问频度初始值 0*/ temp->next = head->next; if(temp->next != NULL) { temp->next ->prior = temp; } temp->prior = head; head->next = temp; } return head; } /*输出链表的节点数据*/ void disp_chain (node *head) { node *temp; for (temp = head->next;temp; temp = temp->next) printf("%c ",temp->data); printf("/n"); return ; } /*释放链表的所占的内存*/ void destroy_chain (node *head) { node *temp; while (head) { temp = head->next ; free(head); head = temp; } } /*核心函数，使元素x节点中freq域的值加1，并调整顺序 若存在temp使temp-> data == x,则返回true否则返回false*/ bool localnode (node *head,datatype x) { node *temp; node *phead; phead = head; for (head = head->next ;head;head = head->next ) { if (head->data == x ) break; } if(head == NULL) return false; else { head->freq ++; for (temp = head->prior ;temp != phead && temp->freq <= head ->freq ; temp = temp->prior) ; /*找到一个节点temp它的频度大于head的频度*/ head->prior ->next = head->next ; if (head->next != NULL ) { head->next ->prior = head->prior ; } /*使head的前一个和后一个相连*/ head->next = temp->next ; head->next->prior = head; temp->next = head; head->prior = temp; /*将head放在temp节点的后面*/ return true; } } int main() { datatype string[] = "abcdefg"; node *head; head = make_chain (string); disp_chain (head); localnode (head,'a'); disp_chain (head); /*此时a应在链表的最前*/ localnode (head,'b'); disp_chain (head); /*此时b应在链表的最前*/ destroy_chain (head); printf("/n"); return 0; }