LeetCode 486预测赢家(java)

class Solution { public boolean PredictTheWinner(int[] nums) { // 特例 int len = nums.length; if (len % 2 == 0) return true; // 动态规划 int[] dp = new int[len]; // 遍历数组 for (int i = len - 1; i >= 0; i--) { dp[i] = nums[i]; for (int j = i + 1; j < len; j++) { int a = nums[i] - dp[j]; int b = nums[j] - dp[j - 1]; dp[j] = Math.max(a, b); } } return dp[len - 1] >= 0; } }