代写java 数据结构 LRU算法、代做LRU算法、代写JAVA LRU程序

日期：2018-06-07 08:21

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<memory.length;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<size;i++) {

if(address.equals(memory[i]))

return true;

}

return false;

}

public String toString() {

String str = "页面"+address+"调入：  ";

for(int i=0;i<size;i++) {

str = str +"|"+ memory[i];

}

return str+"|";

}

public int interrupt() {

return count;

}

}