leetcode 1014. Best Sightseeing Pair

最新推荐文章于 2020-06-17 20:32:01 发布

maverickss

最新推荐文章于 2020-06-17 20:32:01 发布

阅读量107

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/maverickss/article/details/90352585

版权

leetcode 专栏收录该内容

33 篇文章 0 订阅

订阅专栏

Given an array A of positive integers, A[i] represents the value of the i-th sightseeing spot, and two sightseeing spots i and j have distance j - i between them.

The score of a pair (i < j) of sightseeing spots is (A[i] + A[j] + i - j) : the sum of the values of the sightseeing spots, minus the distance between them.

Return the maximum score of a pair of sightseeing spots.

Example 1:

Input: [8,1,5,2,6]
Output: 11
Explanation: i = 0, j = 2, A[i] + A[j] + i - j = 8 + 5 + 0 - 2 = 11

Note:

2 <= A.length <= 50000
1 <= A[i] <= 1000

用一个值存最大值，和到现在为止的最大元素

class Solution(object):
    def maxScoreSightseeingPair(self, A):
        """
        :type A: List[int]
        :rtype: int
        """
        maxsum = A[0]
        maxele = A[0]
        for i in range(1, len(A)):
            maxele = maxele - 1
            if maxele + A[i] > maxsum:
                maxsum = maxele + A[i]
            if maxele < A[i]:
                maxele = A[i]
                
        return maxsum