Python解法 1.奖金 # -*- coding=utf-8 -*- class Solution(): def get_most_money(self, n, nums): if n < 2: return 0 low, high, max_money = 0, n-1, 0 sum_low, sum_high = nums[low], nums[high] while low < high: if sum_low == sum_high: max_money = max(sum_low, max_money) low += 1 high -= 1 sum_low +=...