[LintCode] Coins in a Line 一条线上的硬币
Posted Grandyang
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LintCode] Coins in a Line 一条线上的硬币相关的知识,希望对你有一定的参考价值。
There are n coins in a line. Two players take turns to take one or two coins from right side until there are no more coins left. The player who take the last coin wins.
Could you please decide the first play will win or lose?
n = 1
, return true
.
n = 2
, return true
.
n = 3
, return false
.
n = 4
, return true
.
n = 5
, return true
.
O(n) time and O(1) memory
跟LeetCode上的那道Nim Game几乎一模一样。
解法一:
class Solution { public: /** * @param n: an integer * @return: a boolean which equals to true if the first player will win */ bool firstWillWin(int n) { if (n <= 0) return false; if (n <= 2) return true; vector<bool> dp(n + 1, true); dp[3] = false; for (int i = 4; i <= n; ++i) { dp[i] = dp[i - 3]; } return dp.back(); } };
解法二:
class Solution { public: /** * @param n: an integer * @return: a boolean which equals to true if the first player will win */ bool firstWillWin(int n) { return n % 3 != 0; } };
以上是关于[LintCode] Coins in a Line 一条线上的硬币的主要内容,如果未能解决你的问题,请参考以下文章
[LintCode] Coins in a Line 一条线上的硬币
[LintCode] 395. Coins in a Line 2_Medium tag: Dynamic Programming, 博弈
[LintCode] 394. Coins in a Line_ Medium tag:Dynamic Programming_博弈
[LeetCode] 877. Stone Game == [LintCode] 396. Coins in a Line 3_hard tag: 区间Dynamic Programming, 博弈(