Problem description
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.
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.
题目描述
你和你朋友玩一个游戏:桌子上有一堆的石头,每次你你们可以轮流拿1—3个。谁拿了最后一个石头,谁就是获胜者。你第一个拿石头。
假设你们两个都十分的聪明,都有一套最优化策略。给定石头的数目,写一个函数确定你是否能赢得比赛。
例如:有4个石头,无论怎么样你都无法赢得比赛,无论你拿1、2或者3个石头,最后一个石头总会被你朋友拿走。
结题思路
其实这算不上一道算法题。从1开始,多枚举几次就能发现规律。石头个数是1、2、3的时候,我是获胜者。4的时候对方是获胜者。5、6、7个石头的时候,我只要拿走1个石头,就变成4个石头而且是对手先拿的情况,那么我就是获胜者。8个石头的时候,我无论拿几个石头,对手都能变到4个石头我先拿的情况。
这样下去,不难发现只要是4的倍数,对手就赢。所以只要判断是不是4的倍数就可以了。
class Solution(object):
def canWinNim(self, n):
"""
:type n: int
:rtype: bool
"""
if n % 4 == 0:
return False
else:
return True
用位运算也实现了一次,本以为用时会更少,没想到是一样的。
class Solution(object):
def canWinNim(self, n):
"""
:type n: int
:rtype: bool
"""
if n & 3 == 0:
return False
else:
return True