Solution - OrderedDict
[Reference](https://leetcode.com/problems/lru-cache/discuss/45952/Python-concise-solution-with-comments-(Using-OrderedDict)
OrderedDict = doubly linked list + hash map
- Update chache when
get
.
- If
key
is indic
whenset
, we don’t need to updateremain
, i.e. it’s not consuming capacity.
PREVIOUSAdd Two Numbers