Package g1001_1100.s1014_best_sightseeing_pair

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1014 - Best Sightseeing Pair.

    Medium

    You are given an integer array values where valuesi represents the value of the <code>i<sup>th</sup></code> sightseeing spot. Two sightseeing spots i and j have a distance j - i between them.

    The score of a pair (i &lt; 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, valuesi + valuesj + i - j = 8 + 5 + 0 - 2 = 11

    Example 2:

    Input: values = 1,2

    Output: 2

    Constraints:

    • <code>2 <= values.length <= 5 * 10<sup>4</sup></code>

    • 1 &lt;= values[i] &lt;= 1000

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maxScoreSightseeingPair(IntArray values)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait