Package g0401_0500.s0480_sliding_window_median

Class Solution

java.lang.Object

g0401_0500.s0480_sliding_window_median.Solution

public class Solution
extends Object

480 - Sliding Window Median.

Hard

The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle values.

• For examples, if arr = [2,3,4], the median is 3.
• For examples, if arr = [1,2,3,4], the median is (2 + 3) / 2 = 2.5.

You are given an integer array nums and an integer k. 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 median array for each window in the original array. Answers within 10-5 of the actual value will be accepted.

Example 1:

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

Output: [1.00000,-1.00000,-1.00000,3.00000,5.00000,6.00000]

Explanation: Window position Median ————— —– [1 3 -1 ] -3 5 3 6 7 1 1 [3 -1 -3 ] 5 3 6 7 -1 1 3 [-1 -3 5 ] 3 6 7 -1 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 ] 6

Example 2:

Input: nums = [1,2,3,4,2,3,1,4,2], k = 3

Output: [2.00000,3.00000,3.00000,3.00000,2.00000,3.00000,2.00000]

Constraints:

• 1 <= k <= nums.length <= 105
• -231 <= nums[i] <= 231 - 1

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
double[]	medianSlidingWindow(int[] nums, int k)

Methods inherited from class java.lang.Object

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

Constructor Detail

Solution

public Solution()

Method Detail

medianSlidingWindow

public double[] medianSlidingWindow(int[] nums,
                                    int k)