1979. Find Greatest Common Divisor of Array

Обновлено: 2024-03-12
1 мин
[]

Содержание

LeetCode problem 1979

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