zoukankan      html  css  js  c++  java
  • [LintCode] Coins in a Line III

    Coins in a Line III

    There are n coins in a line. Two players take turns to take a coin from one of the ends of the line until there are no more coins left. The player with the larger amount of money wins.

    Could you please decide the first player will win or lose?

    Example

    Given array A = [3,2,2], return true.

    Given array A = [1,2,4], return true.

    Given array A = [1,20,4], return false.

    Challenge

    Follow Up Question:

    If n is even. Is there any hacky algorithm that can decide whether first player will win or lose in O(1) memory and O(n) time?

    备忘录,dp[left][right]表示从left到right所能取到的最大值,因为双方都取最优策略,所以取完一个后,对手有两种选择,我们要加让对手得到更多value的那种方案,也就是自己得到更少value的方案。

     1 class Solution {
     2 public:
     3     /**
     4      * @param values: a vector of integers
     5      * @return: a boolean which equals to true if the first player will win
     6      */
     7     bool firstWillWin(vector<int> &values) {
     8         // write your code here
     9         int n = values.size();
    10         vector<vector<int>> dp(n + 1, vector<int>(n + 1, -1));
    11         int sum = 0;
    12         for (auto v : values) sum += v;
    13         return sum < 2 * dfs(dp, values, 0, n - 1);
    14     }
    15     int dfs(vector<vector<int>> &dp, vector<int> &values, int left, int right) {
    16         if (dp[left][right] != -1) return dp[left][right];
    17         if (left == right) {
    18             dp[left][right] = values[left];
    19         } else if (left > right) {
    20             dp[left][right] = 0;
    21         } else {
    22             int take_left = min(dfs(dp, values, left + 2, right), dfs(dp, values, left + 1, right - 1)) + values[left];
    23             int take_right = min(dfs(dp, values, left, right - 2), dfs(dp, values, left + 1, right - 1)) + values[right];
    24             dp[left][right] = max(take_left, take_right);
    25         }
    26         return dp[left][right];
    27     }
    28 };
  • 相关阅读:
    C# 设计原则-单一职责原则
    C# Linq的简单运用
    .Net Core中的管道机制
    .Net Core和.Net Framework的区别
    C# 9.0 新特性简析
    .Net core的依赖注入
    .Net IOC容器unity的使用
    网站被黑客攻击百度出现警示
    七牛云免费对象存储(解决图片加载缓慢问题)
    今天第一篇博客 说点随意的内容
  • 原文地址:https://www.cnblogs.com/easonliu/p/4741058.html
Copyright © 2011-2022 走看看