class Solution:
def maxScore(self, nums: List[int], x: int) -> int:
if nums[0]%2==0:
evenMaxScore = nums[0]
oddMaxScore = -x
else:
oddMaxScore = nums[0]
evenMaxScore = -x
for i in range(1, len(nums)):
if nums[i]%2==0:
evenMaxScore=max(evenMaxScore ,oddMaxScore-x)+ nums[i]
else:
oddMaxScore=max(oddMaxScore,evenMaxScore-x)+ nums[i]
return max(evenMaxScore,oddMaxScore)
[2786] 访问数组中的位置使分数最大
最新推荐文章于 2024-07-19 22:56:42 发布