solve problem Nim Game

Author: P-ppc

README.md

@@ -11,4 +11,5 @@ All solutions will be accepted!
 |728|[Self Dividing Numbers](https://leetcode-cn.com/problems/self-dividing-numbers/description/)|[java/py/js](./algorithms/SelfDividingNumbers)|Easy|
 |804|[Unique Morse Code Words](https://leetcode-cn.com/problems/unique-morse-code-words/description/)|[java/py/js](./algorithms/UniqueMorseCodeWords)|Easy|
 |500|[Keyboard Row](https://leetcode-cn.com/problems/keyboard-row/description/)|[java/py/js](./algorithms/KeyboardRow)|Easy|
-|344|[Reverse String](https://leetcode-cn.com/problems/reverse-string/)|[java/py/js](./algorithms/ReverseString)|Easy|
+|344|[Reverse String](https://leetcode-cn.com/problems/reverse-string/)|[java/py/js](./algorithms/ReverseString)|Easy|
+|292|[Nim Game](https://leetcode-cn.com/problems/nim-game/description/)|[java/py/js](./algorithms/NimGame)|Easy|

algorithms/NimGame/README.md

@@ -0,0 +1,2 @@
+# Nim Game
+This problem is easy to solve

algorithms/NimGame/Solution.java

@@ -0,0 +1,5 @@
+class Solution {
+    public boolean canWinNim(int n) {
+        return n % 4 != 0;
+    }
+}

algorithms/NimGame/solution.js

@@ -0,0 +1,7 @@
+/**
+ * @param {number} n
+ * @return {boolean}
+ */
+var canWinNim = function(n) {
+    return n % 4 !== 0
+};

algorithms/NimGame/solution.py

@@ -0,0 +1,8 @@
+class Solution(object):
+    def canWinNim(self, n):
+        """
+        :type n: int
+        :rtype: bool
+        """
+        # if the result of n % 4 != 0, you can remove the number of result, then you can win
+        return n % 4 != 0