-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path146_lru_cache.rb
88 lines (72 loc) · 1.37 KB
/
146_lru_cache.rb
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
# frozen_string_literal: true
# https://leetcode.com/problems/lru-cache/
class LRUCache
# @param {Integer} capacity
def initialize(capacity)
@capacity = capacity
@head = ::Node.new
@tail = ::Node.new
@cache = {}
@head.next = @tail
@tail.prev = @head
end
# @param {Integer} key
# @return {Integer}
def get(key)
node = @cache[key]
return -1 unless node
remove(node)
add(node)
node.val
end
# @param {Integer} key
# @param {Integer} value
# @return {Void}
def put(key, value)
node = @cache[key]
if node
remove(node)
node.val = value
else
if @cache.size == @capacity
@cache.delete(@tail.prev.key)
remove(@tail.prev)
end
node = ::Node.new
node.key = key
node.val = value
@cache[key] = node
end
add(node)
end
private
# @param {Node} node
# @return {Void}
def add(node)
nxt = @head.next
@head.next = node
nxt.prev = node
node.next = nxt
node.prev = @head
end
# @param {Node} node
# @return {Void}
def remove(node)
nxt = node.next
prev = node.prev
nxt.prev = prev
prev.next = nxt
end
end
private
# Cache node
class Node
attr_accessor :key, :val, :prev, :next
# Constructor with default parameters
def initialize
@key = 0
@val = 0
@prev = nil
@next = nil
end
end