zoukankan      html  css  js  c++  java
  • LC 877. Stone Game

    Alex and Lee play a game with piles of stones.  There are an even number of piles arranged in a row, and each pile has a positive integer number of stones piles[i].

    The objective of the game is to end with the most stones.  The total number of stones is odd, so there are no ties.

    Alex and Lee take turns, with Alex starting first.  Each turn, a player takes the entire pile of stones from either the beginning or the end of the row.  This continues until there are no more piles left, at which point the person with the most stones wins.

    Assuming Alex and Lee play optimally, return True if and only if Alex wins the game.

     

    Example 1:

    Input: [5,3,4,5]
    Output: true
    Explanation: 
    Alex starts first, and can only take the first 5 or the last 5.
    Say he takes the first 5, so that the row becomes [3, 4, 5].
    If Lee takes 3, then the board is [4, 5], and Alex takes 5 to win with 10 points.
    If Lee takes the last 5, then the board is [3, 4], and Alex takes 4 to win with 9 points.
    This demonstrated that taking the first 5 was a winning move for Alex, so we return true.
    

     

    Note:

    1. 2 <= piles.length <= 500
    2. piles.length is even.
    3. 1 <= piles[i] <= 500
    4. sum(piles) is odd.

    区间DP。

    Runtime: 12 ms, faster than 26.61% of C++ online submissions for Stone Game.

    class Solution {
    public:
      bool stoneGame(vector<int>& piles) {
        int n = piles.size();
        vector<vector<int>> dp (n+1, vector<int>(n+1,0));
        for(int i=1; i<=n; i++){
          dp[i][i] = piles[i-1];
        }
        for(int len = 2; len <= n; len++){
          for(int i = 1; i < n; i++){
            int j = i + len -1 ;
            if(j > n) continue;
            dp[i][j] = max(dp[i][i] - dp[i+1][j],dp[j][j] - dp[i][j-1]);
          }
        }
        return dp[1][n] > 0;
      }
    };
  • 相关阅读:
    51串口通信
    juicer使用备忘
    51单片机音乐盒程序
    最精简24L01程序--接收
    sqlserver 数据库迁移
    sqlserver自增主键
    js keycode
    tabindex 去掉虚线
    div 绑定keyup
    sqlserver 当前时间减去30天
  • 原文地址:https://www.cnblogs.com/ethanhong/p/10189137.html
Copyright © 2011-2022 走看看