[LeetCode Python3] 858. Mirror Reflection

Python3 Solution:

class Solution:
    def helper(self, p, q):
        p, q = sorted([p, q], reverse = True)
        while q:
            p, q = q, p % q
        return p
    def mirrorReflection(self, p: int, q: int) -> int:
        tmp = self.helper(p, q) # 最大公约数
        # res = p * q // tmp    # 最小公倍数
        if (q // tmp) % 2 == 0: # res为p的偶数倍，即(res//p)%2 == 0
            return 0
        elif (p // tmp) % 2 == 0: # res为q的偶数倍，即(res//q)%2 == 0
            return 2
        else:
            return 1

参考