LeetCode: Find Greatest Common Divisor of Array Solution

Approach

Straight forward:

• find max
• find min
• find gcd between max of min

JavaScript has no built-in gcd function, so we have to implement from scratch

1function gcd(a, b) {
2  if (a % b === 0) {
3    return b
4  }
5  return gcd(b, a % b)
6}

Implementation

1var findGCD = function (nums) {
2  function gcd(a, b) {
3    if (a % b === 0) {
4      return b
5    }
6    return gcd(b, a % b)
7  }
8
9  const max = Math.max.apply(null, nums)
10  const min = Math.min.apply(null, nums)
11
12  return gcd(max, min)
13}