Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1014 with 12 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1014 # by problem number
lcpy gen -s best_sightseeing_pair # by problem name
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.
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
Input: values = [1,2]
Output: 2
2 <= values.length <= 5 * 10^41 <= values[i] <= 1000class Solution:
# Time: O(n)
# Space: O(1)
def max_score_sightseeing_pair(self, values: list[int]) -> int:
best = 0
best_left = values[0]
for j in range(1, len(values)):
best = max(best, best_left + values[j] - j)
best_left = max(best_left, values[j] + j)
return best
| Time | Space |
|---|---|
| O(n) | O(1) |