Mirror Reflection Python Solution with Tests

lcpy gen -n 858   # by problem number
lcpy gen -s mirror_reflection   # by problem name

Input: p = 2, q = 1
Output: 2
Explanation: The ray meets receptor 2 the first time it gets reflected back to the left wall.

Input: p = 3, q = 1
Output: 1

from math import gcd


class Solution:
    # Time: O(log(min(p, q)))
    # Space: O(1)
    def mirror_reflection(self, p: int, q: int) -> int:
        g = gcd(p, q)
        heights, crossings = q // g, p // g
        if heights % 2 == 0:
            return 0
        return 2 if crossings % 2 == 0 else 1