Jump Game VI LeetCode solution in JavaScript

1
var maxResult = function (nums, k) {
2
  let n = nums.length,
3
    deq = [n - 1];
4
  for (let i = n - 2; ~i; i--) {
5
    if (deq[0] - i > k) deq.shift();
6
    nums[i] += nums[deq[0]];
7
    while (deq.length && nums[deq[deq.length - 1]] <= nums[i]) deq.pop();
8
    deq.push(i);
9
  }
10
  return nums[0];
11
};