[Swift]LeetCode292. Nim游戏 | Nim Game

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.

你们是聪明人，每一步都是最优解。 编写一个函数，来判断你是否可以在给定石头数量的情况下赢得游戏。

示例:

输入: 4
输出: false
解释: 如果堆中有 4 块石头，那么你永远不会赢得比赛；
     因为无论你拿走 1 块、2 块 还是 3 块石头，最后一块石头总是会被你的朋友拿走。

1 class Solution {
2     func canWinNim(_ n: Int) -> Bool {
3         //若n=k*(m+1)，则后取着胜
4         //反之，存在先取者获胜的取法。n%(m+1)==0 ,先取者必败
5         return n % 4 != 0
6     }
7 }

原文地址：https://www.cnblogs.com/strengthen/p/9757028.html