cache[k].count =0;intkk =0;//更新其它cache块没使用时间while(kk < M) {if(kk != k){ cache[kk].count++; } kk++; }break; } k++; }//考虑置换那一块.if(k == M) {intii =0;intt =0;//要替换的cache块号.intmax = cache[ii].count; ii++;while(ii < M) {if(cache[ii].c...
可以看到,始终满足的是LRU 源代码: package使用LRU方法更新Cache; import java.awt.*; import java.awt.event.*; import javax.swing.*; import javax.swing.table.*; public class LRUCache extends Frame { public static void main(String[] args) { JFrame.setDefaultLookAndFeelDecorated(true); LRUCache...