第十二天是周日,休息。今天开始第十三天打卡~
讲解链接:239. 滑动窗口最大值
思路是用deque双向列表维护可能的最大元素。其中push原理是从队尾进入的元素要与队中元素从尾到头依次比对,将小于新元素的元素全部从队尾删去,直到队列为空或者前方元素大于等于新元素。
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:
def maxSlidingWindow(self, nums: List[int], k: int) -> 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
用map维护每个数字的出现频率,之后用小顶堆维护前k高的频率和对应的数字。
import heapq
class Solution:
def topKFrequent(self, nums: List[int], k: int) -> List[int]:
#记录nums中数出现的频率
map = dict()
for i in range(len(nums)):
map[nums[i]] = map.get(nums[i], 0) + 1
priority_que = [] #小顶堆
for key, freq in map.items():
heapq.heappush(priority_que, (freq, key))
if len(priority_que) > k:
heapq.heappop(priority_que)
res = [0] * k
for i in range(k-1, -1, -1): #小顶堆是按从小到大顺序出来的,所以需要倒序存
res[i] = heapq.heappop(priority_que)[1]
return res