lru.java

来自「java语言编写的」· Java 代码 · 共 47 行

public class LRU{
	public static void main(String args[])
	{
		
		int address[]={1,2,3,2,8,4,3,9,4,1,2,4,6,8,2};
		int [] stack=new int[4];
		boolean flag;
		System.out.println("地址序列：");
		for(int m=0;m<address.length;m++) 
        System.out.print(address[m]+" ");
        System.out.print("\n");
        //System.out.println("逐次的交换情况：");
		for(int i=0;i<address.length;i++)
		{   int j=0;
		    flag=false;
		    int t, temp=address[i];
		    
			while(stack[j]!=address[i])
			{
				t=stack[j];
				stack[j]=temp;
				temp=t;
				j++;
				if(temp==0||j==stack.length)  break;
			} 
			if(j<stack.length)    
			stack[j]=temp;
			if(temp!=0&&j!=stack.length) 
			flag=true; 
			try
		    {java.lang.Thread.sleep(1000) ;
		    }
		    catch(InterruptedException e)
		    {}
			   
            for(int m=0;m<i-3;m++) 
            System.out.print("  ");
            for(int m=0;m<stack.length;m++) 
            System.out.print(stack[m]+" ");
            if(flag)
                System.out.print("命中");
            System.out.print("\n");
			
		}
		
	}
}