zoukankan      html  css  js  c++  java
  • LeetCode: 292 Nim Game(easy)

    题目:

    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.

    Credits:
    Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

    代码:

    1 class Solution {
    2 public:
    3     bool canWinNim(int n) {
    4         return (n%4 != 0);
    5     }
    6 };
  • 相关阅读:
    信息安全算法
    另类装载问题
    分治法快速排序
    动态规划最长公共子序列
    java网络编程1
    Jndi和会话bean
    EJB初探
    JSF初探
    简单计算器
    关于坐火车
  • 原文地址:https://www.cnblogs.com/llxblogs/p/7434653.html
Copyright © 2011-2022 走看看