Share a short python code

  • 0
    class Solution(object):
        def maxSlidingWindow(self, nums, k):
            :type nums: List[int]
            :type k: int
            :rtype: List[int]
            # maitain a max heap
            heap, result = [], []
            for i, n in enumerate(nums):
                heapq.heappush(heap, (-n, i))
                if i >= k - 1:
                    # remove all out of range max values
                    while heap[0][1] + k <= i:
            return result

    Not that fast though.

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.