分苹果问题

• 老师说把问题具体化，让m=2，甲乙两人分苹果。那么，为了保证甲能赢，甲在倒数第二次拿完苹果后应该要剩下3个苹果(至关重要)。那么甲倒数第三次拿完呢，要剩6个：这时乙如果拿1个，为了保证甲拿完之后剩3个，那么这时甲应该拿2个；乙如果拿了2个，甲应该拿1个。这时已经出现规律了，就是保证在甲拿完之后，剩下的苹果数要满足n % 3 == 0
• 问题的解也就出来了，在甲拿完之后n满足n % (m + 1) == 0，为了保证甲有苹果可拿，所以n最终要满足n % (m + 1) != 0，否则就相当于立场互换了，乙处在甲的立场，即拿完后苹果满足n % (m + 1) == 0，乙是必赢的。
• 经过这么一分析，问题确实变得简单而有趣了。看leetcode上一道题：
   

滴答滴答---题目链接

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.

Example:

Input: 4
Output: false 
Explanation: 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.

class Solution {
public:
    bool canWinNim(int n) {
        if(n%4!=0)
            return true;
        else return false;
    }
};