leetcode 292. Nim Game #Easy
You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the winner. You will take the first turn to remove the stones.
Both of you are very clever and have optimal strategies for the game. Write a function to determine whether you can win the game given the number of stones in the heap.
For example, if there are 4 stones in the heap, then you will never win the game: no matter 1, 2, or 3 stones you remove, the last stone will always be removed by your friend.
举例找出规律:
n=1,2,3 可一次拿完。必胜
n=4 不论第一次拿几个,对方可将剩余一次拿完。必败
n=5=4+1 先拿一个,变成对方应对n=4的情况。必胜
n=6,7 同上
n=8 不论第一次拿几个,对方取后使堆中剩余4个。必败
...
总结:n不被4整除时必胜
class Solution {
public:
bool canWinNim(int n) {
return n&0x3;
}
};