leetcode-292.Nim Game

leetcode-292.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.

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.

怎么说呢，就是找一个策略，我这里想到的是，如果不是4的倍数，那么先手拿1-3个使其变为4的倍数，然后只要对方拿x个，你就拿4-x个，必胜。反之只要是四的倍数，对方采用这个策略，则必输。

package main

import "fmt"

func canWinNim(n int) bool{
    if (n%4 == 0){
        return false
    } else{
        return true
    }
}

func main(){
    flag := canWinNim(4)
    fmt.Println("flag =", flag)

    flag = canWinNim(7)
    fmt.Println("flag =", flag)
}   

Hint:

If there are 5 stones in the heap, could you figure out a way to remove the stones such that you will always be the winner?