#1979 - Find Greatest Common Divisor of Array

Easy • View on LeetCode • View on GitHub

Problem Description

Given an integer array nums, return the greatest common divisor of the smallest number and largest number in nums.

The greatest common divisor of two numbers is the largest positive integer that evenly divides both numbers.

Solution

/**
 * @param {number[]} nums
 * @return {number}
 */
var findGCD = function(nums) {
  return gcd(Math.min(...nums), Math.max(...nums));

  function gcd(a, b) {
    return b === 0 ? a : gcd(b, a % b);
  }
};