Maximum Product of Two Elements in an Array LeetCode solution in JavaScript

1
var maxProduct = function (nums) {
2
  let val = [];
3
  for (let i = 0; i < nums.length; i++) {
4
    for (let j = i + 1; j < nums.length; j++) {
5
      val.push((nums[i] - 1) * (nums[j] - 1));
6
    }
7
  }
8
  return Math.max(...val);
9
};