力扣146题 LRU 缓存机制

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了力扣146题 LRU 缓存机制，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1646字，纯文字阅读大概需要3分钟。

内容图文

问题url
https://leetcode-cn.com/problems/lru-cache/

答案

# -*- coding: utf-8 -*-
cg = "cgnb"
class linknode:
    def __init__(self,key:int,value:int):
        self.key = key
        self.value = value
        self.prenode = None
        self.nextnode = None
class LRUCache:
    def __init__(self, capacity: int):
        self.dict1 = {}
        self.capacity = capacity
        self.headnode = None
        self.lastnode = None      
    def get(self, key: int) -> int:
        if key in self.dict1:
            node = self.dict1[key]
            value = self.dict1[key].value
            pre_node = node.prenode
            next_node = node.nextnode
            if (pre_node is None) & (next_node is None):
                pass
            else:
               if not pre_node is None:
                   if next_node is None:
                      pre_node.nextnode = node
                   else:
                      pre_node.nextnode = next_node
               else :
                   self.headnode = next_node
               if not next_node is None:
                   next_node.prenode = pre_node
            if self.lastnode != node:
               lastnode = self.lastnode
               lastnode.nextnode = node
               node.prenode = lastnode
               node.nextnode = None
               self.lastnode = node
            return value
        else:
            return -1
    def put(self, key: int, value: int) -> None:
        if len(self.dict1) == 0:
            node = linknode(key,value)
            self.dict1[key] = node
            self.headnode = node
            self.lastnode = node
        elif key in self.dict1:
            self.get(key)
            self.dict1[key].value = value
        elif len(self.dict1)<self.capacity:
            node = linknode(key,value)
            self.dict1[key] = node
            node.prenode = self.lastnode
            self.lastnode.nextnode = node
            self.lastnode = node
        else:
            del_key = self.headnode.key
            self.headnode = self.dict1[del_key].nextnode
            del self.dict1[del_key]
            node = linknode(key,value)
            self.dict1[key] = node
            node.prenode = self.lastnode
            self.lastnode.nextnode = node
            self.lastnode = node
        



# Your LRUCache object will be instantiated and called as such:
# obj = LRUCache(capacity)
# param_1 = obj.get(key)
# obj.put(key,value)

内容总结

以上是互联网集市为您收集整理的力扣146题 LRU 缓存机制全部内容，希望文章能够帮你解决力扣146题 LRU 缓存机制所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端

---