# # lru design # @param operators int整型二维数组 the ops # @param k int整型 the k # @return int整型一维数组 # class Solution: def LRU(self , operators , k): # write code here caches = dict() li = [] ret = [] for i in operators: if i[0] == 1: caches[i[1]] = i[2] if i[1] in li: li.remove(i[1]) li.append(i[1]) else: li.append(i[1]) li = li[-k:] else: if i[1] in li: ret.append(caches.get(i[1], -1)) li.remove(i[1]) li.append(i[1]) else: ret.append(-1) return ret