Best Sightseeing Pair LeetCode solution in JavaScript

1
/**
2
 * @param {number[]} values
3
 * @return {number}
4
 */
5
var maxScoreSightseeingPair = function (values) {
6
  let n = values.length,
7
    prevIndexMaxAddition = values[n - 1],
8
    maxValue = -2;
9
  for (let i = n - 2; i > -1; i--) {
10
    let curIndexMaxAddition = Math.max(values[i], prevIndexMaxAddition - 1);
11
    let curIndexMaxValue = values[i] + prevIndexMaxAddition - 1;
12
    if (maxValue < curIndexMaxValue) {
13
      maxValue = curIndexMaxValue;
14
    }
15
    prevIndexMaxAddition = curIndexMaxAddition;
16
  }
17
  return maxValue;
18
};