中国住建网的官网_微信商城如何开通_提交百度一下_百度推广关键词规划师

题目：

题解：

class Solution {public boolean PredictTheWinner(int[] nums) {int length = nums.length;int[] dp = new int[length];for (int i = 0; i < length; i++) {dp[i] = nums[i];}for (int i = length - 2; i >= 0; i--) {for (int j = i + 1; j < length; j++) {dp[j] = Math.max(nums[i] - dp[j], nums[j] - dp[j - 1]);}}return dp[length - 1] >= 0;}
}