LeetCode 1014 Best Sightseeing Pair (思维 推荐)

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:

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

题目链接：https://leetcode.com/problems/best-sightseeing-pair/

题目分析：维护一个左端点值curVal，其向右移动时每次减1，相当于带上距离带来的影响，如果当前curVal小于A[i]，则curVal对i后面数字带来的收益肯定不会大于A[i]，故更新curVal

2ms，时间击败100%

class Solution {
    public int maxScoreSightseeingPair(int[] A) {
        int curVal = A[0], ans = 0, pairSum = 0;
        for (int i = 1; i < A.length; i++) {
            curVal--;
            pairSum = A[i] + curVal;
            if (pairSum > ans) {
                ans = pairSum;
            }
            if (A[i] > curVal) {
                curVal = A[i];
            }
        }
        return ans;
    }
}