Skip to content

Commit fee4595

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent 85bc541 commit fee4595

File tree

2 files changed

+105
-1
lines changed

2 files changed

+105
-1
lines changed

‎markdowns/Questions_By_Code_Length.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -27,6 +27,7 @@ Calculations are based on the code files's byte sizes.
2727
| 1302 | [Deepest Leaves Sum](<https://leetcode.com/problems/deepest-leaves-sum>) | Medium | | [solution](<_1302. Deepest Leaves Sum.md>) | c, js, py | Jun 07, 2024 |
2828
| 227 | [Basic Calculator II](<https://leetcode.com/problems/basic-calculator-ii>) | Medium | | [solution](<_227. Basic Calculator II.md>) | py | Jun 10, 2024 |
2929
| 648 | [Replace Words](<https://leetcode.com/problems/replace-words>) | Medium | Daily | [solution](<_648. Replace Words.md>) | java, py | Jun 07, 2024 |
30+
| 146 | [LRU Cache](<https://leetcode.com/problems/lru-cache>) | Medium | N150 | [solution](<_146. LRU Cache.md>) | py | Nov 10, 2025 |
3031
| 1718 | [Construct the Lexicographically Largest Valid Sequence](<https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence>) | Medium | Daily | [solution](<_1718. Construct the Lexicographically Largest Valid Sequence.md>) | py | Feb 16, 2025 |
3132
| 523 | [Continuous Subarray Sum](<https://leetcode.com/problems/continuous-subarray-sum>) | Medium | Daily | [solution](<_523. Continuous Subarray Sum.md>) | py | Jun 08, 2024 |
3233
| 1482 | [Minimum Number of Days to Make m Bouquets](<https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets>) | Medium | Daily | [solution](<_1482. Minimum Number of Days to Make m Bouquets.md>) | py | Jun 19, 2024 |
@@ -273,7 +274,6 @@ Calculations are based on the code files's byte sizes.
273274
| 1598 | [Crawler Log Folder](<https://leetcode.com/problems/crawler-log-folder>) | Easy | Daily | [solution](<_1598. Crawler Log Folder.md>) | c, js | Jul 10, 2024 |
274275
| 3212 | Weekly Contest 405 - q3 - [Count Submatrices With Equal Frequency of X and Y](<https://leetcode.com/problems/count-submatrices-with-equal-frequency-of-x-and-y>) | Medium | Contest | [solution](<_3212. Count Submatrices With Equal Frequency of X and Y.md>) | py | Jul 07, 2024 |
275276
| 1218 | [Longest Arithmetic Subsequence of Given Difference](<https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference>) | Medium | | [solution](<_1218. Longest Arithmetic Subsequence of Given Difference.md>) | py | May 31, 2024 |
276-
| 146 | [LRU Cache](<https://leetcode.com/problems/lru-cache>) | Medium | N150 | [solution](<_146. LRU Cache.md>) | py | Nov 10, 2025 |
277277
| 33 | [Search in Rotated Sorted Array](<https://leetcode.com/problems/search-in-rotated-sorted-array>) | Medium | B75, N150 | [solution](<_33. Search in Rotated Sorted Array.md>) | py | Dec 17, 2024 |
278278
| 394 | [Decode String](<https://leetcode.com/problems/decode-string>) | Medium | | [solution](<_394. Decode String.md>) | py | Jun 15, 2024 |
279279
| 102 | [Binary Tree Level Order Traversal](<https://leetcode.com/problems/binary-tree-level-order-traversal>) | Medium | B75, N150 | [solution](<_102. Binary Tree Level Order Traversal.md>) | java | Jul 04, 2024 |

‎markdowns/_146. LRU Cache.md‎

Lines changed: 104 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -21,6 +21,7 @@
2121
## Solutions
2222

2323
- [m146 v1.py](<../my-submissions/m146 v1.py>)
24+
- [m146 v2 proper DLL.py](<../my-submissions/m146 v2 proper DLL.py>)
2425
### Python
2526
#### [m146 v1.py](<../my-submissions/m146 v1.py>)
2627
```Python
@@ -64,3 +65,106 @@ class LRUCache:
6465
# obj.put(key,value)
6566
```
6667

68+
#### [m146 v2 proper DLL.py](<../my-submissions/m146 v2 proper DLL.py>)
69+
```Python
70+
class DLLNode:
71+
def __init__(
72+
self,
73+
key: int,
74+
data: int,
75+
prev_node: Optional['DLLNode'] = None,
76+
next_node: Optional['DLLNode'] = None
77+
):
78+
self.key = key
79+
self.data = data
80+
self.prev = prev_node
81+
self.next = next_node
82+
83+
class LRUCache:
84+
def __init__(self, capacity: int):
85+
self.head = None
86+
self.tail = None
87+
self.key2node = {}
88+
self.cap = capacity
89+
self.size = 0
90+
91+
def get(self, key: int) -> int:
92+
if key not in self.key2node :
93+
return -1
94+
95+
output_data = self.pop(key)
96+
self.append_end(key, output_data)
97+
return output_data
98+
99+
def put(self, key: int, value: int) -> None:
100+
if key in self.key2node :
101+
self.pop(key)
102+
103+
if self.size >= self.cap :
104+
self.pop()
105+
106+
self.append_end(key, value)
107+
108+
def append_end(self, key: int, data: int) -> None:
109+
new_node = DLLNode(key=key, data=data, prev_node=self.tail)
110+
self.key2node[key] = new_node
111+
self.size += 1
112+
113+
# this should apply to both if tail and head doesn't exist
114+
# since if at least one node exists, it's both tail and head
115+
if not self.tail :
116+
self.head = new_node
117+
self.tail = new_node
118+
return
119+
120+
self.tail.next = new_node
121+
self.tail = new_node
122+
123+
# Default pop last
124+
def pop(self, key: int = None) -> int :
125+
if self.size == 0 :
126+
return -1
127+
128+
# Pop LFU node by default
129+
if key is None :
130+
key = self.head.key
131+
132+
if key not in self.key2node :
133+
return -1
134+
135+
self.size -= 1
136+
popping_node = self.key2node.pop(key)
137+
output_data = popping_node.data
138+
139+
# If it was the only node in DLL
140+
if self.size == 0 :
141+
self.head = None
142+
self.tail = None
143+
return output_data
144+
145+
# if is head
146+
if popping_node.prev is None :
147+
self.head = popping_node.next
148+
if self.head is not None :
149+
self.head.prev = None
150+
return output_data
151+
152+
# if is tail
153+
if popping_node.next is None :
154+
self.tail = popping_node.prev
155+
if self.tail is not None :
156+
self.tail.next = None
157+
return output_data
158+
159+
# Regular node
160+
prev_node, next_node = popping_node.prev, popping_node.next
161+
prev_node.next, next_node.prev = next_node, prev_node
162+
return output_data
163+
164+
165+
# Your LRUCache object will be instantiated and called as such:
166+
# obj = LRUCache(capacity)
167+
# param_1 = obj.get(key)
168+
# obj.put(key,value)
169+
```
170+

0 commit comments

Comments
 (0)