代码随想录第13天：239. 滑动窗口最大值 347.前 K 个高频元素

from collections import deque
class Myqueue:
    def __init__(self):
        self.queue=deque()
    def push(self,value):
        while self.queue and self.queue[-1]<value:
            self.queue.pop()
        self.queue.append(value)
    def pop(self,value):
        if self.queue and value==self.queue[0]:
            self.queue.popleft()
    def max(self):
        return self.queue[0]
class Solution(object):
    def maxSlidingWindow(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: List[int]
        """
        d=Myqueue()
        i=k
        while i>0:
            d.push(nums[k-i])
            i-=1
        l=[]
        l.append(d.max())
        for i in range(k,len(nums)):
            d.pop(nums[i-k])
            d.push(nums[i])
            l.append(d.max())
        return l

单调队列这个算法只能说真妙啊

#
# @lc app=leetcode.cn id=347 lang=python
#
# [347] 前 K 个高频元素
#

# @lc code=start
import heapq

class Solution(object):
    def topKFrequent(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: List[int]
        """
        My_dict={}
        for i in nums:
            if My_dict.get(i,-1)==-1:
                My_dict[i]=1
            else:
                My_dict[i]+=1
        pri_que = [] #小顶堆
        
        #用固定大小为k的小顶堆，扫描所有频率的数值
        for key, freq in My_dict.items():
            heapq.heappush(pri_que, (freq, key))
            if len(pri_que) > k: #如果堆的大小大于了K，则队列弹出，保证堆的大小一直为k
                heapq.heappop(pri_que)
        
        #找出前K个高频元素，因为小顶堆先弹出的是最小的，所以倒序来输出到数组
        result = [0] * k
        for i in range(k-1, -1, -1):
            result[i] = heapq.heappop(pri_que)[1]
        return result
        
# @lc code=end

这题python用heap做比较简单