-
Notifications
You must be signed in to change notification settings - Fork 0
/
sliding_window_median.js
79 lines (73 loc) · 2.33 KB
/
sliding_window_median.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
// https://leetcode.com/problems/sliding-window-median/
// 480. Sliding Window Median
/**
* @param {number[]} nums
* @param {number} k
* @return {number[]}
*/
var medianSlidingWindow = function(nums, k) {
let res = [],
main_win =[],
copy_win = [],
odd = k % 2 === 1,
median_index = odd ? Math.floor(k / 2) : k / 2 - 1,
median_index_next = median_index + 1;
if (nums.length < k) return res
// Create and sort window
main_win = nums.slice(0, k);
copy_arr = [...main_win].sort((a, b) => a - b);
for(let i=k;i<nums.length;i++){
const median = odd
? copy_arr[median_index]
: (copy_arr[median_index] + copy_arr[median_index_next]) / 2
res.push(median);
main_win.shift();
main_win.push(nums[i]);
copy_arr = [...main_win].sort((a, b) => a - b);
}
const median = odd
? copy_arr[median_index]
: (copy_arr[median_index] + copy_arr[median_index_next]) / 2
res.push(median);
return res
};
console.log("Sliding Window Median")
console.log(medianSlidingWindow([1,3,-1,-3,5,3,6,7], 3));
// Output: [1.00000,-1.00000,-1.00000,3.00000,5.00000,6.00000]
console.log(medianSlidingWindow([1,2,3,4,2,3,1,4,2], 3));
// Output: [2, 3, 3, 3, 2, 3, 2]
console.log(medianSlidingWindow([1,3,-1,-3,5,3,6,7], 4));
// Output: [0.0, 1.0, 1.0, 4.0, 5.5]
console.log(medianSlidingWindow([1,3,-1,-3,5,3,6,7], 1));
// Output: [1,3,-1,-3,5,3,6,7]
console.log(medianSlidingWindow([1,3,-1,-3,5,3,6,7], 10));
// Output: []
// ***************************
// https://leetcode.com/problems/sliding-window-maximum/description/
// 239. Sliding Window Maximum
/**
* @param {number[]} nums
* @param {number} k
* @return {number[]}
*/
var maxSlidingWindow = function(nums, k) {
let res = [],
main_win =[];
if (nums.length < k) return res
// Create and sort window
main_win = nums.slice(0, k);
for(let i=k;i<nums.length;i++){
res.push(Math.max(...main_win));
main_win.shift();
main_win.push(nums[i]);
}
res.push(Math.max(...main_win));
return res
};
console.log("Sliding Window Maximum")
console.log(maxSlidingWindow([1,3,-1,-3,5,3,6,7], 3));
// Output: [3,3,5,5,6,7]
console.log(maxSlidingWindow([1], 1));
// Output: [1]
console.log(maxSlidingWindow([1,3,-1,-3,5,3,6,7], 10));
// Output: []