-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path544-OutputContestMatches.go
More file actions
79 lines (69 loc) · 3.11 KB
/
544-OutputContestMatches.go
File metadata and controls
79 lines (69 loc) · 3.11 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
68
69
70
71
72
73
74
75
76
77
78
79
package main
// 544. Output Contest Matches
// During the NBA playoffs, we always set the rather strong team to play with the rather weak team,
// like making the rank 1 team play with the rank nth team,
// which is a good strategy to make the contest more interesting.
// Given n teams, return their final contest matches in the form of a string.
// The n teams are labeled from 1 to n, which represents their initial rank
// (i.e., Rank 1 is the strongest team and Rank n is the weakest team).
// We will use parentheses '(', and ')' and commas ',' to represent the contest team pairing.
// We use the parentheses for pairing and the commas for partition.
// During the pairing process in each round, you always need to follow the strategy of making the rather strong one pair with the rather weak one.
// Example 1:
// Input: n = 4
// Output: "((1,4),(2,3))"
// Explanation:
// In the first round, we pair the team 1 and 4, the teams 2 and 3 together, as we need to make the strong team and weak team together.
// And we got (1, 4),(2, 3).
// In the second round, the winners of (1, 4) and (2, 3) need to play again to generate the final winner, so you need to add the paratheses outside them.
// And we got the final answer ((1,4),(2,3)).
// Example 2:
// Input: n = 8
// Output: "(((1,8),(4,5)),((2,7),(3,6)))"
// Explanation:
// First round: (1, 8),(2, 7),(3, 6),(4, 5)
// Second round: ((1, 8),(4, 5)),((2, 7),(3, 6))
// Third round: (((1, 8),(4, 5)),((2, 7),(3, 6)))
// Since the third round will generate the final winner, you need to output the answer (((1,8),(4,5)),((2,7),(3,6))).
// Constraints:
// n == 2x where x in in the range [1, 12].
import "fmt"
import "strconv"
import "math"
func findContestMatch(n int) string {
res := make([]string, 0)
for i := 1; i <= n; i++ {
res = append(res, strconv.Itoa(i))
}
for i := 0; i < int(math.Log2((float64(n)))); i++ {
left, right := 0, len(res)-1
newRes := make([]string, 0)
for left < right {
newRes = append(newRes, "("+res[left]+","+res[right]+")")
left++
right--
}
res = newRes
}
return res[0]
}
func main() {
// Example 1:
// Input: n = 4
// Output: "((1,4),(2,3))"
// Explanation:
// In the first round, we pair the team 1 and 4, the teams 2 and 3 together, as we need to make the strong team and weak team together.
// And we got (1, 4),(2, 3).
// In the second round, the winners of (1, 4) and (2, 3) need to play again to generate the final winner, so you need to add the paratheses outside them.
// And we got the final answer ((1,4),(2,3)).
fmt.Println(findContestMatch(4)) // "((1,4),(2,3))"
// Example 2:
// Input: n = 8
// Output: "(((1,8),(4,5)),((2,7),(3,6)))"
// Explanation:
// First round: (1, 8),(2, 7),(3, 6),(4, 5)
// Second round: ((1, 8),(4, 5)),((2, 7),(3, 6))
// Third round: (((1, 8),(4, 5)),((2, 7),(3, 6)))
// Since the third round will generate the final winner, you need to output the answer (((1,8),(4,5)),((2,7),(3,6))).
fmt.Println(findContestMatch(8)) // "(((1,8),(4,5)),((2,7),(3,6)))"
}