1、题目描述
2、解题思路
team[i] 为当前轮第 i 强的队伍。我们依照轮次维护这些信息。
每轮中,第 i 个队伍变成 “(” + team[i] + “,” + team[n-1-i] + “)”,然后只剩下一半的队伍。
3、解题代码
class Solution {
public String findContestMatch(int n) {
String[] team = new String[n];
for (int i = 0; i < n; i++) {
team[i] = "" + (i + 1);
}
while (n > 1) {
for (int i = 0; i < n / 2; i++) {
team[i] = "(" + team[i] + "," + team[n - 1 - i] + ")";
}
n = n / 2;
}
return team[0];
}
}