代码
package package1;
import java.util.Arrays;
public class alg {
public static boolean isIn(int[] nums, int tar) {
for (int n : nums) {
if (tar == n) {
return true;
}
}
return false;
}
public static void fifo(int[] list){
System.out.println("------------ 先进先出页面置换算法-------------------");
int[] contain = new int[3];
float times = 0;
for(int i = 0; i < 3; i++){
contain[i] = list[i];
}
for(int i = 3; i < list.length; i++){
if(!isIn(contain, list[i])){
times++;
contain[0] = contain[1];
contain[1] = contain[2];
contain[2] = list[i];
System.out.println("缺页中断- " + "导入:" + list[i]