find-greatest-common-divisor-of-array.py

class Solution:
    def findGCD(self, nums: List[int]) -> int:
        def gcd(a, b):
            if b == 0:
                return a
            return gcd(b, a % b)

        return gcd(min(nums), max(nums))