1688. Count of Matches in Tournament

[Krolck]

Pull Request Template

Description

In a tournament, if the current number of teams in the tournament (n) is even, n / 2 matches are played, and n / 2 teams advance to the next round. If n is odd, (n - 1) / 2 matches are played, and (n - 1) / 2 + 1 teams advance. Return the number of matches played in the tournament until a winner is decided.

Constraints:

1 <= n <= 200

Put check marks:

Have you made changes in README file ?

• [✔ ] Added problem & solution under correct topic.
• [✔ ] Specified Space & Time complexity.
• [ ✔] Specified difficulty level, tag & Note(if any).

How Has This Been Tested?

Please describe the tests that you ran to verify your changes. Please also note any relevant details for your test configuration.

• [✔ ] Input 7
• [✔ ] Input 14
• [✔ ] Input 200
• [✔] Input 1

Make sure all below guidelines are followed else PR will get Reject:

• [✔ ] My code follows the style guidelines of this project
• [✔ ] I have performed a self-review of my own code
• [ ✔] I have commented my code so that it is easy to understand
• [✔ ] I have made corresponding changes to the documentation
• [✔ ] My changes generate no new warnings
• [✔ ] Any dependent changes have been merged and published in downstream modules

[welcome]

I can tell this is your first pull request! Thank you I'm so honored. 🎉🎉🎉 I'll take a look at it ASAP!