Add solution #1979

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,666 LeetCode solutions in JavaScript
+# 1,667 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1518,6 +1518,7 @@
 1975|[Maximum Matrix Sum](./solutions/1975-maximum-matrix-sum.js)|Medium|
 1976|[Number of Ways to Arrive at Destination](./solutions/1976-number-of-ways-to-arrive-at-destination.js)|Medium|
 1977|[Number of Ways to Separate Numbers](./solutions/1977-number-of-ways-to-separate-numbers.js)|Hard|
+1979|[Find Greatest Common Divisor of Array](./solutions/1979-find-greatest-common-divisor-of-array.js)|Easy|
 1980|[Find Unique Binary String](./solutions/1980-find-unique-binary-string.js)|Medium|
 1985|[Find the Kth Largest Integer in the Array](./solutions/1985-find-the-kth-largest-integer-in-the-array.js)|Medium|
 1996|[The Number of Weak Characters in the Game](./solutions/1996-the-number-of-weak-characters-in-the-game.js)|Medium|

solutions/1979-find-greatest-common-divisor-of-array.js

@@ -0,0 +1,23 @@
+/**
+ * 1979. Find Greatest Common Divisor of Array
+ * https://leetcode.com/problems/find-greatest-common-divisor-of-array/
+ * Difficulty: Easy
+ *
+ * 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.
+ */
+
+/**
+ * @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);
+  }
+};