Add solution #1014

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,088 LeetCode solutions in JavaScript
+# 1,089 LeetCode solutions in JavaScript
 
 [https://leetcode.com/](https://leetcode.com/)
 
@@ -822,6 +822,7 @@
 1011|[Capacity To Ship Packages Within D Days](./solutions/1011-capacity-to-ship-packages-within-d-days.js)|Medium|
 1012|[Numbers With Repeated Digits](./solutions/1012-numbers-with-repeated-digits.js)|Hard|
 1013|[Partition Array Into Three Parts With Equal Sum](./solutions/1013-partition-array-into-three-parts-with-equal-sum.js)|Easy|
+1014|[Best Sightseeing Pair](./solutions/1014-best-sightseeing-pair.js)|Medium|
 1022|[Sum of Root To Leaf Binary Numbers](./solutions/1022-sum-of-root-to-leaf-binary-numbers.js)|Easy|
 1023|[Camelcase Matching](./solutions/1023-camelcase-matching.js)|Medium|
 1028|[Recover a Tree From Preorder Traversal](./solutions/1028-recover-a-tree-from-preorder-traversal.js)|Hard|

solutions/1014-best-sightseeing-pair.js

@@ -0,0 +1,29 @@
+/**
+ * 1014. Best Sightseeing Pair
+ * https://leetcode.com/problems/best-sightseeing-pair/
+ * Difficulty: Medium
+ *
+ * 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.
+ */
+
+/**
+ * @param {number[]} values
+ * @return {number}
+ */
+var maxScoreSightseeingPair = function(values) {
+  let maxLeft = values[0];
+  let result = 0;
+
+  for (let j = 1; j < values.length; j++) {
+    result = Math.max(result, maxLeft + values[j] - j);
+    maxLeft = Math.max(maxLeft, values[j] + j);
+  }
+
+  return result;
+};