Add solution #877

Author: JoshCrozier

README.md

@@ -684,6 +684,7 @@
 874|[Walking Robot Simulation](./0874-walking-robot-simulation.js)|Medium|
 875|[Koko Eating Bananas](./0875-koko-eating-bananas.js)|Medium|
 876|[Middle of the Linked List](./0876-middle-of-the-linked-list.js)|Easy|
+877|[Stone Game](./0877-stone-game.js)|Medium|
 884|[Uncommon Words from Two Sentences](./0884-uncommon-words-from-two-sentences.js)|Easy|
 889|[Construct Binary Tree from Preorder and Postorder Traversal](./0889-construct-binary-tree-from-preorder-and-postorder-traversal.js)|Medium|
 890|[Find and Replace Pattern](./0890-find-and-replace-pattern.js)|Medium|

solutions/0877-stone-game.js

@@ -0,0 +1,25 @@
+/**
+ * 877. Stone Game
+ * https://leetcode.com/problems/stone-game/
+ * Difficulty: Medium
+ *
+ * Alice and Bob play a game with piles of stones. There are an even number of piles arranged in a
+ * row, and each pile has a positive integer number of stones piles[i].
+ *
+ * The objective of the game is to end with the most stones. The total number of stones across all
+ * the piles is odd, so there are no ties.
+ *
+ * Alice and Bob take turns, with Alice starting first. Each turn, a player takes the entire pile
+ * of stones either from the beginning or from the end of the row. This continues until there are
+ * no more piles left, at which point the person with the most stones wins.
+ *
+ * Assuming Alice and Bob play optimally, return true if Alice wins the game, or false if Bob wins.
+ */
+
+/**
+ * @param {number[]} piles
+ * @return {boolean}
+ */
+var stoneGame = function(piles) {
+  return true;
+};