OPT算法，FIFO算法，LRU算法，LFU算法的java程序

import java.util.Scanner;


public class systemLab3 {
    final static int NUM=20;
    final static int FRAME = 3;
    public static int []pages = new int[NUM];
    public static void main(String[] args)
    {
        Scanner s = new Scanner(System.in);
        System.out.print("依次输入数组:");
        for(int i=0;i<NUM;i++)
        {
            pages[i] = s.nextInt();
        }
        System.out.println("opt:");
        opt(pages);
        System.out.println("fifo:");
        fifo(pages);
        System.out.println("lru:");
        lru(pages);
        System.out.println("lfu:");
        lfu(pages);
    }
    public static void opt(int []pages)
    {
        int []frames = new int[FRAME];
        for(int i=0;i<FRAME;i++)   //0-frame装入并输出
        {
            frames[i] = pages[i];
            System.out.print("当前页面:");
            for(int j=0;j<=i;j++)
            {
                System.out.print(frames[j]+" ");
            }
            System.out.print("\n");
        }

        for(int i=FRAME;i<pages.length;i++)  //后续数组内容opt置换
        {
            boolean isIncluded = false;   //判断页匡内是否含有下一个内容
            int posToSwitch;  //置换位置的下标
            for(int j=0;j<FRAME;j++)
            {
                if(frames[j] == pages[i])
                    isIncluded = true;
            }
            if(!isIncluded)
            {
                int []nextI