Ai
1 Star 2 Fork 5

LilithSangreal/LeetCode-Solutions

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
maximum-frequency-stack.py 823 Bytes
一键复制 编辑 原始数据 按行查看 历史
Allen Liu 提交于 2018-10-13 01:56 +08:00 . add complexity
# Time: O(1)
# Space: O(n)
import collections
class FreqStack(object):
def __init__(self):
self.__freq = collections.Counter()
self.__group = collections.defaultdict(list)
self.__maxfreq = 0
def push(self, x):
"""
:type x: int
:rtype: void
"""
self.__freq[x] += 1
if self.__freq[x] > self.__maxfreq:
self.__maxfreq = self.__freq[x]
self.__group[self.__freq[x]].append(x)
def pop(self):
"""
:rtype: int
"""
x = self.__group[self.__maxfreq].pop()
if not self.__group[self.__maxfreq]:
self.__group.pop(self.__maxfreq)
self.__maxfreq -= 1
self.__freq[x] -= 1
if not self.__freq[x]:
self.__freq.pop(x)
return x
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/LilithSangreal/LeetCode-Solutions.git
git@gitee.com:LilithSangreal/LeetCode-Solutions.git
LilithSangreal
LeetCode-Solutions
LeetCode-Solutions
master

搜索帮助