JIAKAOBO

LeetCode

venmo
wechat

感谢赞助!

  • ㊗️
  • 大家
  • offer
  • 多多！

Problem

During the NBA playoffs, we always set the rather strong team to play with the rather weak team, like make 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 == 2^x where x in in the range [1, 12].

Code

class Solution {
    public String findContestMatch(int n) {
        String[] teams = new String[n];
        
        for (int i = 1; i <= n; i++) {
            teams[i - 1] = i + "";
        }

        while (n > 1) {
            for (int i = 0; i < n / 2; i++) {
                String first = teams[i];
                String sec = teams[n - 1 - i];
                
                String match = "(" + first + "," + sec + ")";
                teams[i] = match;
            }
            
            n /= 2;
        }
        
        return teams[0];
    }
}

class Solution {
    public String findContestMatch(int n) {
        List<String> teams = new ArrayList<>();
        for(int i = 1; i <= n; i++) {
            teams.add(i + "");
        }
        
        while(teams.size() != 1) {
            List<String> curr = new ArrayList<>();

            for(int i = 0; i < teams.size() / 2; i++) {
                String first = teams.get(i);
                String sec = teams.get(teams.size() - 1 - i);
                
                String match = "(" + first + "," + sec + ")";
                curr.add(match);
            }
            
            teams = curr;
        }
        
        return teams.get(0);
    }
}