Package g0201_0300.s0239_sliding_window_maximum

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    239 - Sliding Window Maximum.

    Hard

    You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position.

    Return the max sliding window.

    Example 1:

    Input: nums = 1,3,-1,-3,5,3,6,7, k = 3

    Output: 3,3,5,5,6,7

    Explanation:

    Window position Max

    1 3 -1 -3 5 3 6 7 3

    1 3 -1 -3 5 3 6 7 3

    1 3 -1 -3 5 3 6 7 5

    1 3 -1 -3 5 3 6 7 5

    1 3 -1 -3 5 3 6 7 6

    1 3 -1 -3 5 3 6 7 7

    Example 2:

    Input: nums = 1, k = 1

    Output: 1

    Constraints:

    • <code>1 <= nums.length <= 10<sup>5</sup></code>

    • <code>-10<sup>4</sup><= numsi<= 10<sup>4</sup></code>

    • 1 &lt;= k &lt;= nums.length

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final IntArray maxSlidingWindow(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait