代码随想录算法训练营第十三天 | 239. 滑动窗口最大值、347.前 K 个高频元素

第一题

题目描述：https://leetcode.cn/problems/sliding-window-maximum/
   
思路：
   具体代码如下：

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

第二题

题目描述：
   https://leetcode.cn/problems/top-k-frequent-elements/
思路：
   具体代码如下：

import heapq

class Solution:
    def topKFrequent(self, nums: List[int], k: int) -> List[int]:

        map_ = {} #nums[i]:
        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