try-leetcode/algorithms/golang/292.nim-game.go at master · devfan2021/try-leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
/*
 * @lc app=leetcode id=292 lang=golang
 *
 * [292] Nim Game
 *
 * https://leetcode.com/problems/nim-game/description/
 *
 * algorithms
 * Easy (55.46%)
 * Likes:    634
 * Dislikes: 1666
 * Total Accepted:    224.8K
 * Total Submissions: 409.6K
 * Testcase Example:  '4'
 *
 * 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.
 */

// @lc code=start
func canWinNim(n int) bool {
	return canWinNim1(n)
}

func canWinNim1(n int) bool {
	return n%4 != 0
}

// @lc code=end