solves count number of matches in tournament

Author: anishLearnsToCode

README.md

@@ -415,7 +415,7 @@
 | 1672 | [Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth)                                                                          |                                                              [![Java](assets/java.png)](src/RichestCustomerWealth.java)                                                              |                                                                                                                                   |
 | 1678 | [Goal Parser Interpretation](https://leetcode.com/problems/goal-parser-interpretation)                                                                    |                                                            [![Java](assets/java.png)](src/GoalParserInterpretation.java)                                                             |                                                                                                                                   |
 | 1684 | [Count the Number of Consistent Strings](https://leetcode.com/problems/count-the-number-of-consistent-strings)                                            |                                                        [![Java](assets/java.png)](src/CountTheNumberOfConsistentStrings.java)                                                        |                                                                                                                                   |
-| 1688 | [Count of Matches in Tournament](https://leetcode.com/problems/count-of-matches-in-tournament)                                                            |                                                                                                                                                                                      |                                                                                                                                   |
+| 1688 | [Count of Matches in Tournament](https://leetcode.com/problems/count-of-matches-in-tournament)                                                            |                                                           [![Java](assets/java.png)](src/CountOfMatchesInTournament.java)                                                            |                                                                                                                                   |
 | 1694 | [Reformat Phone Number](https://leetcode.com/problems/reformat-phone-number)                                                                              |                                                                                                                                                                                      |                                                                                                                                   |
 | 1700 | [Number of Students Unable to Eat Lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch)                                            |                                                                                                                                                                                      |                                                                                                                                   |
 | 1704 | [Determine if String Halves Are Alike](https://leetcode.com/problems/determine-if-string-halves-are-alike)                                                |                                                                                                                                                                                      |                                                                                                                                   |

src/CountOfMatchesInTournament.java

@@ -0,0 +1,10 @@
+// https://leetcode.com/problems/count-of-matches-in-tournament
+// T: O(log N)
+// S: O(log N)
+
+public class CountOfMatchesInTournament {
+    public int numberOfMatches(int n) {
+        if (n == 1) return 0;
+        return n / 2 + numberOfMatches(n - n / 2);
+    }
+}