1979. Find Greatest Common Divisor of Array Updated: 2024-03-12 1 min read Algorithms , LeetCode On This PageLeetCode problem 1979class Solution: def findGCD(self, nums: List[int]) -> int: return gcd(max(nums), min(nums))