∥该结点的访问频度加1 current -p: ∥从链表中摘下这个结点 current→lik→ rLink= current-rlink; ∥寻找从新插入的位置 while(p I=first & current-freq>p-freq current→·rLmk=p→ rlink; 插入在p之后 } ot find!\n" /段没找到p→freq++; //该结点的访问频度加 1 current = p; //从链表中摘下这个结点 current→lLink→rLink = current→rLink; current→rLink→lLink = current→lLink; p = current→lLink; //寻找从新插入的位置 while ( p != first && current→freq > p→freq ) p = p→lLink; current→rLink = p→rLink; //插入在 p 之后 current→lLink = p; p→rLink→lLink = current; p→rLink = current; } else cout<<"Sorry. Not find!\n"; //没找到 }