Solve #292

Author: aylei

src/lib.rs

@@ -220,3 +220,4 @@ mod n0283_move_zeroes;
 mod n0287_find_the_duplicate_number;
 mod n0289_game_of_life;
 mod n0290_word_pattern;
+mod n0292_nim_game;

src/n0292_nim_game.rs

@@ -0,0 +1,37 @@
+/**
+ * [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.
+ *
+ * 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.
+ */
+pub struct Solution {}
+
+// submission codes start here
+
+impl Solution {
+    pub fn can_win_nim(n: i32) -> bool {
+        n % 4 != 0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_292() {
+        assert_eq!(Solution::can_win_nim(4), false);
+    }
+}