# LRU算法

67人阅读 评论(0)

LRU算法

1. 是什么：LRU是Least Recently Used 的缩写，翻译过来就是“最近最少使用”，也就是说，LRU缓存把最近最少使用的数据移除，让给最新读取的数据。而往往最常读取的，也是读取次数最多的，所以，利用LRU缓存，我们能够提高系统的performance.
2. 实现：
//实现
public class LRUCache1<K, V> {

private final int MAX_CACHE_SIZE;
private Entry first;
private Entry last;

private HashMap<K, Entry<K, V>> hashMap;

public LRUCache1(int cacheSize) {
MAX_CACHE_SIZE = cacheSize;
hashMap = new HashMap<K, Entry<K, V>>();
}

public void put(K key, V value) {
Entry entry = getEntry(key);
if (entry == null) {
if (hashMap.size() >= MAX_CACHE_SIZE) {
hashMap.remove(last.key);
removeLast();
}
entry = new Entry();
entry.key = key;
}
entry.value = value;
moveToFirst(entry);
hashMap.put(key, entry);
}

public V get(K key) {
Entry<K, V> entry = getEntry(key);
if (entry == null) return null;
moveToFirst(entry);
return entry.value;
}

public void remove(K key) {
Entry entry = getEntry(key);
if (entry != null) {
if (entry.pre != null) entry.pre.next = entry.next;
if (entry.next != null) entry.next.pre = entry.pre;
if (entry == first) first = entry.next;
if (entry == last) last = entry.pre;
}
hashMap.remove(key);
}

private void moveToFirst(Entry entry) {
if (entry == first) return;
if (entry.pre != null) entry.pre.next = entry.next;
if (entry.next != null) entry.next.pre = entry.pre;
if (entry == last) last = last.pre;

if (first == null || last == null) {
first = last = entry;
return;
}

//这一段没看明白
entry.next = first;
first.pre = entry;
first = entry;
entry.pre = null;
}

private void removeLast() {
if (last != null) {
last = last.pre;
if (last == null) first = null;
else last.next = null;
}
}

private Entry<K, V> getEntry(K key) {
return hashMap.get(key);
}

@Override
public String toString() {
StringBuilder sb = new StringBuilder();
Entry entry = first;
while (entry != null) {
sb.append(String.format("%s:%s ", entry.key, entry.value));
entry = entry.next;
}
return sb.toString();
}

class Entry<K, V> {
public Entry pre;
public Entry next;
public K key;
public V value;
}
}
//测试
public class LRUCacheTest {
public static void main(String[] args)throws Exception{
System.out.println("start...");

LRUCacheTest test = new LRUCacheTest();
test.lruCache1();
}

void lruCache1(){
System.out.println();
System.out.println("===========================LRU 链表实现===========================");
LRUCache1<Integer,String> lru = new LRUCache1<Integer, String>(5);
lru.put(1,"11");
lru.put(2,"11");
lru.put(3,"11");
lru.put(4,"11");
lru.put(5,"11");
System.out.println(lru.toString());
lru.put(6,"66");
lru.get(2);
lru.put(7,"77");
lru.get(4);
System.out.println(lru.toString());
System.out.println();
}
}
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：434次
• 积分：20
• 等级：
• 排名：千里之外
• 原创：0篇
• 转载：4篇
• 译文：0篇
• 评论：0条
文章分类