Find Greatest Common Divisor of Array LeetCode solution in JavaScript

1
var findGCD = function (nums) {
2
  let newNum = [Math.min(...nums), Math.max(...nums)];
3
  let firstNum = newNum[0];
4
  let secondNum = newNum[1];
5
  while (secondNum) {
6
    let newNum = secondNum;
7
    secondNum = firstNum % secondNum;
8
    firstNum = newNum;
9
  }
10
  return firstNum;
11
};