1979. Find Greatest Common Divisor of Array

class Solution {
    public int findGCD(int[] nums) {
        int min = Integer.MAX_VALUE;
        int max = Integer.MIN_VALUE;
        for (int num : nums) {
            min = Math.min(min, num);
            max = Math.max(max, num);
        }

        return gcd(min, max);
    }
    private int gcd(int a, int b) {
        while (b != 0) {
            int temp = a % b;
            a = b;
            b = temp;
        }
        return a;
    }
}

class Solution:
    def findGCD(self, nums: List[int]) -> int:
        from math import gcd
        return gcd(min(nums), max(nums))

var findGCD = function(nums) {
    const gcd = (a, b) => {
        while (b !== 0) {
            let t = a % b;
            a = b;
            b = t;
        }
        return a;
    };

    let mn = Math.min(...nums);
    let mx = Math.max(...nums);

    return gcd(mn, mx);
};

var findGCD = function(nums) {
    const gcd = (a, b) => {
        while (b !== 0) {
            let t = a % b;
            a = b;
            b = t;
        }
        return a;
    };

    let mn = Math.min(...nums);
    let mx = Math.max(...nums);

    return gcd(mn, mx);
};