README_EN.md

1014. Best Sightseeing Pair

中文文档

Description

You are given an integer array values where values[i] represents the value of the ith sightseeing spot. Two sightseeing spots i and j have a distance j - i between them.

The score of a pair (i < j) of sightseeing spots is values[i] + values[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: values = [8,1,5,2,6]
Output: 11
Explanation: i = 0, j = 2, values[i] + values[j] + i - j = 8 + 5 + 0 - 2 = 11

Example 2:

Input: values = [1,2]
Output: 2

 

Constraints:

• 2 <= values.length <= 5 * 104
• 1 <= values[i] <= 1000

Solutions

Python3

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

Java

class Solution {
    public int maxScoreSightseeingPair(int[] values) {
        int res = 0, mx = values[0];
        for (int i = 1; i < values.length; ++i) {
            res = Math.max(res, values[i] - i + mx);
            mx = Math.max(mx, values[i] + i);
        }
        return res;
    }
}

C++

class Solution {
public:
    int maxScoreSightseeingPair(vector<int>& values) {
        int res = 0, mx = values[0];
        for (int i = 1; i < values.size(); ++i) {
            res = max(res, values[i] - i + mx);
            mx = max(mx, values[i] + i);
        }
        return res;
    }
};

Go

func maxScoreSightseeingPair(values []int) int {
	res, mx := 0, values[0]
	for i := 1; i < len(values); i++ {
		res = max(res, values[i]-i+mx)
		mx = max(mx, values[i]+i)
	}
	return res
}

func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

...