Python | Leetcode Python题解之第486题预测赢家
题目：
题解：
class Solution:
def PredictTheWinner(self, nums: List[int]) -> bool:
length = len(nums)
dp = [0] * length
for i, num in enumerate(nums):
dp[i] = num
for i in range(length - 2, -1, -1):
for j in range(i + 1, length):
dp[j] = max(nums[i] - dp[j], nums[j] - dp[j - 1])
return dp[length - 1] >= 0
原文地址：https://blog.csdn.net/Mopes__/article/details/142995681
免责声明：本站文章内容转载自网络资源，如本站内容侵犯了原著者的合法权益，可联系本站删除。更多内容请关注自学内容网（zxcms.com）！