Add solution #1688

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,475 LeetCode solutions in JavaScript
+# 1,476 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1300,6 +1300,7 @@
 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|
 1687|[Delivering Boxes from Storage to Ports](./solutions/1687-delivering-boxes-from-storage-to-ports.js)|Hard|
+1688|[Count of Matches in Tournament](./solutions/1688-count-of-matches-in-tournament.js)|Easy|
 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/1688-count-of-matches-in-tournament.js

@@ -0,0 +1,22 @@
+/**
+ * 1688. Count of Matches in Tournament
+ * https://leetcode.com/problems/count-of-matches-in-tournament/
+ * Difficulty: Easy
+ *
+ * You are given an integer n, the number of teams in a tournament that has strange rules:
+ * - If the current number of teams is even, each team gets paired with another team. A total
+ *   of n / 2 matches are played, and n / 2 teams advance to the next round.
+ * - If the current number of teams is odd, one team randomly advances in the tournament, and
+ *   the rest gets paired. A total of (n - 1) / 2 matches are played, and (n - 1) / 2 + 1 teams
+ *   advance to the next round.
+ *
+ * Return the number of matches played in the tournament until a winner is decided.
+ */
+
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var numberOfMatches = function(n) {
+  return n - 1;
+};