Lintcode1511 · Mirror Reflection go

/**
1511 · Mirror Reflection
Algorithms
Medium
Accepted Rate
74%

DescriptionSolutionNotesDiscussLeaderboard
Description
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.

Return the number of the receptor that the ray meets first. (It is guaranteed that the ray will meet a receptor eventually.)

1 <= p <= 10001<=p<=1000
0 <= q <= p0<=q<=p
Example
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.
https://lintcode-media.oss-us-west-1.aliyuncs.com/problem/reflection.png
Example 2:

Input: p = 3, q = 1
Output: 1
Explanation: The ray meets receptor 1 the first time it gets reflected back to the left wall.
Tags
Company
Google
Recommend Courses

https://www.cnblogs.com/grandyang/p/10646040.html

https://www.lintcode.com/problem/1511/
*/

/**
 * @param p: an integer
 * @param q: an integer
 * @return: the number of the receptor that the ray meets first
 */
func mirrorReflection (p int, q int) int {
	// Write your code here
	for {
		if !(p % 2 == 0 && q % 2 ==0) {
			break
		}
		p /=2
		q /= 2
	}
	if p % 2 == 0 {
		return 2
	}
	if q % 2 == 0 {
		return 0
	}
	return 1
}