# leetcode 858. Mirror Reflection（python）

·  阅读 677

### 描述

There is a special square room with mirrors on each of the four walls. Except for the southwest corner, there are receptors on each of the remaining corners, numbered 0, 1, and 2. The square room has walls of length p and a laser ray from the southwest corner first meets the east wall at a distance q from the 0th receptor.

Given the two integers p and q, return the number of the receptor that the ray meets first. The test cases are guaranteed so that the ray will meet a receptor eventually.

Example 1:

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

Example 2:

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

Note:

``````1 <= q <= p <= 1000

### 解答

``````class Solution:
def mirrorReflection(self, p: int, q: int) -> int:
g = gcd(p, q)
p = (p / g) % 2
q = (q / g) % 2
if p == 1 and q == 1:
return 1
return 0 if p == 1 else 2

### 运行结果

``````Runtime: 34 ms, faster than 90.10% of Python3 online submissions for Mirror Reflection.
Memory Usage: 13.8 MB, less than 97.03% of Python3 online submissions for Mirror Reflection.

### 原题链接

leetcode.com/problems/mi…

### 思路参考

leetcode.cn/problems/mi…