【代码随想录】Day 13 239.滑动窗口最大值 347.前K个高频元素
239.滑动窗口最大值
定义一个单调队列,队列里的元素要排序,最大的元素放在队列口,维护有可能是最大值的元素在队列出口,弹出没有加入元素大的所有元素
from collections import deque
class MyQueue:
def __init__(self):
self.queue =deque()
def pop (self, value):
if self.queue and value == self.queue[0]:
self.queue.popleft()
def push(self,value):
while self.queue and value>self.queue[-1]:
self.queue.pop()
self.queue.append(value)
def front(self):
return self.queue[0]
class Solution(object):
def maxSlidingWindow(self, nums, k):
"""
:type nums: List[int]
:type k: int
:rtype: List[int]
"""
que = MyQueue()
result=[]
for i in range(k):
que.push(nums[i])
result.append(que.front())
for i in range(k,len(nums)):
que.pop(nums[i-k])
que.push(nums[i])
result.append(que.front())
return result
347.前K个高频元素
先统计每个元素出现的频率
定义一个大小为k的小顶堆,扫描所有元素放入堆
如果元素超过k,弹出堆顶的元素(堆顶的元素频率最小)
倒序输出
class Solution(object):
def topKFrequent(self, nums, k):
"""
:type nums: List[int]
:type k: int
:rtype: List[int]
"""
map_ ={}
for i in range(len(nums)):
map_[nums[i]] = map_.get(nums[i],0)+ 1
pri_que = []
for key, freq in map_.items():
heapq.heappush(pri_que,(freq,key))
if len(pri_que)>k:
heapq.heappop(pri_que)
result=[0]*k
for i in range(k-1,-1,-1):
result[i] = heapq.heappop(pri_que)[1]
return result
heapq.heappush(pri_que,(freq,key)),加入pri_que的元素是元组,heapq.heappop(pri_que)[1]是将元组中的第二个元素放入result