544. Output Contest Matches
来源:互联网 发布:三维图片制作软件 编辑:程序博客网 时间:2024/06/08 10:41
During the NBA playoffs, we always arrange 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. Now, you're given n teams, you need to output their final contest matches in the form of a string.
The n teams are given in the form of positive integers from 1 to n, which represents their initial rank. (Rank 1 is the strongest team and Rank n is the weakest team.) We'll use parentheses('(', ')') and commas(',') to represent the contest team pairing - parentheses('(' , ')') for pairing and 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: 2Output: (1,2)Explanation: Initially, we have the team 1 and the team 2, placed like: 1,2.Then we pair the team (1,2) together with '(', ')' and ',', which is the final answer.
Example 2:
Input: 4Output: ((1,4),(2,3))Explanation: In the first round, we pair the team 1 and 4, the team 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 3:
Input: 8Output: (((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))).
Note:
- The n is in range [2, 212].
- We ensure that the input n can be converted into the form 2k, where k is a positive integer.
public class Solution { public String findContestMatch(int n) { List<String> list = new ArrayList<String>(); for (int i = 1; i <= n; i ++) { list.add(i + ""); } while (list.size() > 1) { List<String> temp = new ArrayList<String>(); for (int i = 0; i < list.size()/2; i ++) { temp.add("(" + list.get(i) + "," + list.get(list.size() - 1 - i) + ")"); } list = temp; } return list.get(0); }}
- 544. Output Contest Matches
- [Leetcode] 544. Output Contest Matches 解题报告
- fatal error LNK1149: output filename matches input filename
- Output\TEST.sct(7): error: L6236E: No section matches selector
- matches()
- output
- Output
- output
- Output
- Contest
- Matches Game
- java matches
- matches()总结
- Matches UVA
- Output.h && Output.c
- String的matches使用方法
- 13.2 匹配集合Matches
- Matches 集合解说
- hibernate的基本使用
- 正则表达式
- 异步 同步 阻塞 非阻塞
- kafka zookeeper docker容器互联
- android侧滑
- 544. Output Contest Matches
- Ubuntu 中软件的安装、卸载以及查看的方法总结
- 微信小程序日历
- Hibernate整理学习(一)
- 移植OpenSSL加密软件到ARM
- PHP的array_keys() 函数
- WPF studying~随记
- 悟得一句真言
- HTML与JSP跳转的相对路径的区别