leetcode-lintcode-LRU缓存

package bd_algo;

import java.util.LinkedHashMap;
import java.util.Map;

/**
 * Created by Administrator on 2017/8/29.
 */
public class LRUCache {
    public static void main(String[] args) {

    }
    int capacity;
    Map<Integer, Integer> map = new LinkedHashMap<>();
    public LRUCache(int capacity) {
        // write your code here
        this.capacity = capacity;
    }

    // @return an integer
    public int get(int key) {
        // write your code here
        if(map.containsKey(key)){
            int val = map.get(key);
            map.remove(key);
            map.put(key, val);
            return val;
        }else {
            return -1;
        }
    }

    // @param key, an integer
    // @param value, an integer
    // @return nothing
    public void set(int key, int value) {
        // write your code here
        map.put(key, value);
        if(map.size() > capacity){
            for (Integer i:
                 map.keySet()) {
                map.remove(i);
                break;
            }
        }
    }
}