Add solution #1686

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,473 LeetCode solutions in JavaScript
+# 1,474 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1298,6 +1298,7 @@
 1681|[Minimum Incompatibility](./solutions/1681-minimum-incompatibility.js)|Hard|
 1684|[Count the Number of Consistent Strings](./solutions/1684-count-the-number-of-consistent-strings.js)|Easy|
 1685|[Sum of Absolute Differences in a Sorted Array](./solutions/1685-sum-of-absolute-differences-in-a-sorted-array.js)|Medium|
+1686|[Stone Game VI](./solutions/1686-stone-game-vi.js)|Medium|
 1716|[Calculate Money in Leetcode Bank](./solutions/1716-calculate-money-in-leetcode-bank.js)|Easy|
 1718|[Construct the Lexicographically Largest Valid Sequence](./solutions/1718-construct-the-lexicographically-largest-valid-sequence.js)|Medium|
 1726|[Tuple with Same Product](./solutions/1726-tuple-with-same-product.js)|Medium|

solutions/1686-stone-game-vi.js

@@ -0,0 +1,51 @@
+/**
+ * 1686. Stone Game VI
+ * https://leetcode.com/problems/stone-game-vi/
+ * Difficulty: Medium
+ *
+ * Alice and Bob take turns playing a game, with Alice starting first.
+ *
+ * There are n stones in a pile. On each player's turn, they can remove a stone from the pile and
+ * receive points based on the stone's value. Alice and Bob may value the stones differently.
+ *
+ * You are given two integer arrays of length n, aliceValues and bobValues. Each aliceValues[i]
+ * and bobValues[i] represents how Alice and Bob, respectively, value the ith stone.
+ *
+ * The winner is the person with the most points after all the stones are chosen. If both players
+ * have the same amount of points, the game results in a draw. Both players will play optimally.
+ * Both players know the other's values.
+ *
+ * Determine the result of the game, and:
+ * - If Alice wins, return 1.
+ * - If Bob wins, return -1.
+ * - If the game results in a draw, return 0.
+ */
+
+/**
+ * @param {number[]} aliceValues
+ * @param {number[]} bobValues
+ * @return {number}
+ */
+var stoneGameVI = function(aliceValues, bobValues) {
+  const n = aliceValues.length;
+  const stones = aliceValues.map((alice, i) => ({
+    sum: alice + bobValues[i],
+    alice: alice,
+    bob: bobValues[i]
+  }));
+
+  stones.sort((a, b) => b.sum - a.sum);
+
+  let aliceScore = 0;
+  let bobScore = 0;
+
+  for (let i = 0; i < n; i++) {
+    if (i % 2 === 0) {
+      aliceScore += stones[i].alice;
+    } else {
+      bobScore += stones[i].bob;
+    }
+  }
+
+  return aliceScore > bobScore ? 1 : aliceScore < bobScore ? -1 : 0;
+};