FindGCD

Published at 2021-10-15

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

        maxNum = max(nums)
        minNum = min(nums)
        for i in range(minNum, 0, -1):
            if minNum % i == 0 and maxNum % i == 0:
                return i