239. 滑动窗口最大值
class Myqueue:
def __init__(self):
self.queue = deque()
def pop(self, val: int):
if self.queue and val == self.queue[0]:
self.queue.popleft() #pop出口处元素
def push(self, val: int):
while self.queue and val > self.queue[-1]:
self.queue.pop()
self.queue.append(val)
def getMax(self):
return self.queue[0]
class Solution:
def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:
que = Myqueue()
res = []
for i in range(k):
que.push(nums[i])
res.append(que.getMax())
for i in range (k, len(nums)):
que.pop(nums[i - k])
que.push(nums[i])
res.append(que.getMax())
return res
大致理解 有点难
347.前 K 个高频元素
用到的数据结构:大顶堆(根节点最大,从大到小) 小顶堆(根节点最小,从小到大)
(这两个数据结构 适合求数据集中前几个高频低频的元素)
用堆去遍历map里的元素 把小的pop出去
import heapq
class Solution:
def topKFrequent(self, nums: List[int], k: int) -> List[int]:
map = dict()
for n in nums:
if n in map:
map[n] += 1
else:
map[n] = 1
# 小顶堆
pri_que = []
# num frequency
for key, val in map.items():
heapq.heappush(pri_que, (val, key))
if len(pri_que) > k:
heapq.heappop(pri_que)
res = [0]*k
for i in range(k - 1, -1, -1):
res[i] = heapq.heappop(pri_que)[1]
return res