292. Nim Game
You are playing the following Nim Game with your friend:
- Initially, there is a heap of stones on the table.
- You and your friend will alternate taking turns, and you go first.
- On each turn, the person whose turn it is will remove 1 to 3 stones from the heap.
- The one who removes the last stone is the winner.
Given n, the number of stones in the heap, return true if you can win the game assuming both you and your friend play optimally, otherwise return false.
Example 1:
Example 2:
Example 3:
Constraints:
- 1 < = n < = 2 31 − 1 1 <= n <= 2^{31} - 1 1<=n<=231−1
From: LeetCode
Link: 292. Nim Game
Solution:
Ideas:
- The function canWinNim takes an integer n as input, representing the number of stones.
- It returns true if n is not a multiple of 4, meaning you can win.
- It returns false if n is a multiple of 4, meaning you will lose if both players play optimally.
Code:
bool canWinNim(int n) {
return n % 4 != 0;
}