[LeetCode Sync] Runtime - 71 ms (48.93%), Memory - 23.3 MB (21.48%)

Author: NamVr

1063-best-sightseeing-pair/README.md

@@ -0,0 +1,29 @@
+<p>You are given an integer array <code>values</code> where values[i] represents the value of the <code>i<sup>th</sup></code> sightseeing spot. Two sightseeing spots <code>i</code> and <code>j</code> have a <strong>distance</strong> <code>j - i</code> between them.</p>
+
+<p>The score of a pair (<code>i &lt; j</code>) of sightseeing spots is <code>values[i] + values[j] + i - j</code>: the sum of the values of the sightseeing spots, minus the distance between them.</p>
+
+<p>Return <em>the maximum score of a pair of sightseeing spots</em>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> values = [8,1,5,2,6]
+<strong>Output:</strong> 11
+<strong>Explanation:</strong> i = 0, j = 2, values[i] + values[j] + i - j = 8 + 5 + 0 - 2 = 11
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> values = [1,2]
+<strong>Output:</strong> 2
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>2 &lt;= values.length &lt;= 5 * 10<sup>4</sup></code></li>
+	<li><code>1 &lt;= values[i] &lt;= 1000</code></li>
+</ul>

1063-best-sightseeing-pair/solution.py

@@ -0,0 +1,18 @@
+class Solution:
+    def maxScoreSightseeingPair(self, values: List[int]) -> int:
+        # score = values[i] + values[j] + i - j
+        n = len(values)
+
+        # left score initially is value of first element
+        max_left_score = values[0]
+
+        res = 0
+
+        for i in range(1,n):
+            current_right_score = values[i] - i
+            res = max(res, max_left_score + current_right_score)
+
+            current_left_score = values[i] + i
+            max_left_score = max(max_left_score, current_left_score)
+
+        return res