Repository navigation
Expand file tree
/
Copy pathProblem1688.java
More file actions
67 lines (53 loc) · 2.15 KB
/
Copy pathProblem1688.java
File metadata and controls
67 lines (53 loc) · 2.15 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
/*
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.
Example 1:
Input: n = 7
Output: 6
Explanation: Details of the tournament:
- 1st Round: Teams = 7, Matches = 3, and 4 teams advance.
- 2nd Round: Teams = 4, Matches = 2, and 2 teams advance.
- 3rd Round: Teams = 2, Matches = 1, and 1 team is declared the winner.
Total number of matches = 3 + 2 + 1 = 6.
Example 2:
Input: n = 14
Output: 13
Explanation: Details of the tournament:
- 1st Round: Teams = 14, Matches = 7, and 7 teams advance.
- 2nd Round: Teams = 7, Matches = 3, and 4 teams advance.
- 3rd Round: Teams = 4, Matches = 2, and 2 teams advance.
- 4th Round: Teams = 2, Matches = 1, and 1 team is declared the winner.
Total number of matches = 7 + 3 + 2 + 1 = 13.
Constraints:
1 <= n <= 200
*/
package leetcode;
public class Problem1688 {
public static void main(String[] args) {
System.out.println("1688. Count of Matches in Tournament");
int n = 7;
System.out.println("Input: n = " + n);
int output = numberOfMatches(n);
System.out.println("Output: " + output);
n = 14;
System.out.println("Input: n = " + n);
output = numberOfMatches(n);
System.out.println("Output: " + output);
}
/**
* Calculates the number of matches required to determine the champion in a
* tournament with 'n' teams.
*
* @param n the number of teams in the tournament
* @return the number of matches required
*/
public static int numberOfMatches(final int n) {
/*
* Every match eliminates one team, so the number of matches required
* is equal to the number of teams minus one.
*/
return n - 1;
}
}