LRU近期最少使用算法

LRU是Least Recently Used 近期最少使用算法，一种页面置换算法，其实现较为简单，Java实现代码如下

import java.util.LinkedList;
import java.util.List;

public class LRU {
    
    private List<Integer> executeSeries = new LinkedList<Integer>();
    
    public LRU(Integer[] executeSeries) {
        for (Integer temp : executeSeries) {
            put(temp);
        }
    }
    
    public void put(Integer cur) {
        if (cur == null) {
            return;
        }
        for (Integer temp : executeSeries) {
            if (cur.equals(temp)) {
                executeSeries.remove(temp);
                break;
            }
        }
        executeSeries.add(cur);
        System.out.println(ShowUtil.toString(executeSeries));
    }
    
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Integer[] executeSeries = {1,2,3,1,2,3,3,4};
        new LRU(executeSeries);
    }
}