zoukankan      html  css  js  c++  java
  • [LeetCode][JavaScript]Nim Game

    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.

    Hint:

    1. 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?

    推算一下就好了,4的倍数会输。

     1 /**
     2  * @param {number} n
     3  * @return {boolean}
     4  */
     5 var canWinNim = function(n) {
     6     if (n % 4 === 0){
     7         return false;
     8     }
     9     return true;
    10 };
  • 相关阅读:
    6.5 列出当前目录所有文件
    6.4 协程写文件
    6.3 写文件
    6.2 创建空目录
    6.1 os 获取文件状态
    5.13 json
    es2016
    短路原理
    fexbox
    vue @
  • 原文地址:https://www.cnblogs.com/Liok3187/p/4874716.html
Copyright © 2011-2022 走看看