dp[i][j]表示i到j区间先手拿最终最多能拿多少分,sum[i][j]表示区间i到j的和,那么状态转移方程:dp[i][j] = max(nums[i] + sum[i+1][j] - dp[i+1][j], nums[j] + sum[i][j-1] - dp[i][j-1])
class Solution {
public:
bool PredictTheWinner(vector<int>& nums) {
int n = nums.size();
vector<vector<int>> sum(n, vector<int>(n, 0));
for (int j=n-1;j>=0;--j) {
for (int i=j;i>=0;--i) {
if (i == j) sum[i][j] = nums[i];
else sum[i][j] = nums[i] + sum[i+1][j];
}
}
vector<vector<int>> dp(n, vector<int>(n, 0));
for (int d = 0;d<n;++d) {
for (int i=0;i<n-d;++i) {
int j=i+d;
if (i==j) dp[i][i] = nums[i];
else dp[i][j] = max(nums[i] + sum[i+1][j] - dp[i+1][j], nums[j] + sum[i][j-1] - dp[i][j-1]);
}
}
return 2*dp[0][n-1] >= sum[0][n-1];
}
};
但是看了发现根本没有必要知道具体能拿多少分,dp[i][j]表示区间i到j先手拿能比对方多拿多少分就行了。。。转移方程:d[i][j] = max(nums[i] - dp[i+1][j], nums[j] - dp[i][j-1])
class Solution {
public:
bool PredictTheWinner(vector<int>& nums) {
int n = nums.size();
vector<vector<int>> dp(n, vector<int>(n, 0));
for (int i = 0; i < n; ++i) dp[i][i] = nums[i];
for (int len = 1; len < n; ++len) {
for (int i = 0, j = len; j < n; ++i, ++j) {
dp[i][j] = max(nums[i] - dp[i + 1][j], nums[j] - dp[i][j - 1]);
}
}
return dp[0][n - 1] >= 0;
}
};