Maximum Product of Three Numbers LeetCode solution in JavaScript

1
var maximumProduct = function (nums) {
2
  nums.sort((a, b) => a - b);
3

4
  var lastNumber = nums.length - 1;
5
  var midNumber = nums.length - 2;
6
  var firstNumber = nums.length - 3;
7
  var total = nums[lastNumber] * nums[midNumber] * nums[firstNumber];
8
  return total;
9
};