辅导java 数据结构 LRU算法、讲解LRU算法、辅导JAVA LRU程序辅导R语言程序|辅导R语言程序

package proj;
import java.util.PriorityQueue;

public class LRU {
private int size;
private String[] memory;
private String address;
private int count = 0;

public LRU(int size) {
this.size = size;
memory = new String[size];
}

public void addLRU(String address) {
this.address = address;
if(contains(address)) {
for(int i=0;i if(address.equals(memory[i])) {
String str = memory[i];
for(int j=i;j>0;j--) {
memory[j] = memory[j-1];
}
memory[0]=str;
return;
}
}
} else {
count++;
for(int j=size-1;j>0;j--) {
memory[j] = memory[j-1];
}
memory[0]=address;
}
}

private boolean contains(String address) {

for(int i=0;i if(address.equals(memory[i]))
return true;
}
return false;
}

public String toString() {

String str = ""+address+"： ";
for(int i=0;i str = str +"|"+ memory[i];
}
return str+"|";
}

public int interrupt() {
return count;
}

辅导java 数据结构 LRU算法、讲解LRU算法、辅导JAVA LRU程序 辅导R语言程序|辅导R语言程序

辅导java 数据结构 LRU算法、讲解LRU算法、辅导JAVA LRU程序辅导R语言程序|辅导R语言程序