# I am the Watcher. I am your guide through this vast new twtiverse.
#
# Usage:
# https://watcher.sour.is/api/plain/users View list of users and latest twt date.
# https://watcher.sour.is/api/plain/twt View all twts.
# https://watcher.sour.is/api/plain/mentions?uri=:uri View all mentions for uri.
# https://watcher.sour.is/api/plain/conv/:hash View all twts for a conversation subject.
#
# Options:
# uri Filter to show a specific users twts.
# offset Start index for quey.
# limit Count of items to return (going back in time).
#
# twt range = 1 1
# self = https://watcher.sour.is/conv/htsgtxa
golang 實現 LFU 緩存算法**
題目描述 LFUCache(int capacity) - 用數據結構的容量 capacity 初始化對象 int get(int key) - 如果鍵 key 存在於緩存中，則獲取鍵的值，否則返回 -1 void put(int key, int value) - 如果鍵 key 已存在，則變更其值；如果鍵不存在，請插入鍵值對。當緩存達到其容量 capacity 時，則應該在 ⌘ Read more