Skip to content

fix typo in the explanation of problem 146 #3

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 1 commit into from
Closed

fix typo in the explanation of problem 146 #3

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion leetcode-146-LRU-Cache.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,7 @@

# 思路分析

看到 `O(1)` 的空间复杂度首先想到的就是用 `HashMap` 去存储。
看到 `O(1)` 的时间复杂度首先想到的就是用 `HashMap` 去存储。

之后的问题就是怎么实现，当存满的时候删除最远一次操作过的元素。

Expand Down