leetcode-1014-最佳观光组合

Posted 2020-12-11 真不知道叫啥好

 

 解：O(N)

class Solution:
    def maxScoreSightseeingPair(self, A: List[int]) -> int:
        left, res = A[0], -1
        for j in range(1, len(A)):
            res = max(res, left + A[j] - j)
            left = max(left, A[j] + j)
        return res