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: 2
Output: (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: 4
Output: ((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: 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))). 

Note:

  1. The n is in range [2, 212].
  2. We ensure that the input n can be converted into the form 2k, where k is a positive integer.

有n只队伍(n的范围[2, 212], 正偶数),编号为1 ~ n,队伍按照最强和最弱的分在一组的原则分组比赛,给出一直到最后一轮比赛的分组方法。

解法1:迭代iterative,

解法2:递归recursive,

Java:

public String findContestMatch(int n) {
List<String> matches = new ArrayList<>();
for(int i = 1; i <= n; i++) matches.add(String.valueOf(i)); while(matches.size() != 1){
List<String> newRound = new ArrayList<>();
for(int i = 0; i < matches.size()/2; i++)
newRound.add("(" + matches.get(i) + "," + matches.get(matches.size() - i - 1) + ")");
matches = newRound;
}
return matches.get(0);
}

Java:

 public String findContestMatch(int n) {
String[] m = new String[n];
for (int i = 0; i < n; i++) {
m[i] = String.valueOf(i + 1);
} while (n > 1) {
for (int i = 0; i < n / 2; i++) {
m[i] = "(" + m[i] + "," + m[n - 1 - i] + ")";
}
n /= 2;
} return m[0];
}

Java: LinkedList  

public String findContestMatch(int n) {
LinkedList<String> res = new LinkedList<>(); for (int i = 1; i <= n; i++) res.add(i + ""); while (res.size() > 1) {
LinkedList<String> tmp = new LinkedList<>(); while (!res.isEmpty()) {
tmp.add("(" + res.remove(0) + "," + res.remove(res.size() - 1) + ")");
} res = tmp;
} return res.get(0);
}

Java:

public string FindContestMatch(int n) {
string[] arr = new string[n];
for (int i = 0; i < n; i++) arr[i] = (i + 1).ToString(); int left = 0;
int right = n - 1;
while (left < right)
{
while (left < right)
{
arr[left] = "(" + arr[left] + "," + arr[right] + ")";
left++;
right--;
}
left = 0;
} return arr[0];
} 

Python:

# Time:  O(n)
# Space: O(n)
class Solution(object):
def findContestMatch(self, n):
"""
:type n: int
:rtype: str
"""
matches = map(str, range(1, n+1))
while len(matches)/2:
matches = ["({},{})".format(matches[i], matches[-i-1]) for i in xrange(len(matches)/2)]
return matches[0]

Python:

class Solution(object):
def solve(self, groups):
size = len(groups)
if size == 1: return groups[0]
ngroups = []
for x in range(size / 2):
ngroups.append('(' + groups[x] + ',' + groups[size - x - 1] + ')')
return self.solve(ngroups) def findContestMatch(self, n):
"""
:type n: int
:rtype: str
"""
return self.solve(map(str, range(1, n + 1)))

Python: wo

class Solution():
def contestMatches(self, n):
s = []
for i in xrange(n):
s.append(str(i + 1))
while n > 1:
cur = []
for m in xrange(len(s) / 2):
cur.append((s[m], s[len(s) - 1 - m]))
s = cur
n /= 2 return s[0]   

Python: wo

class Solution():
def contestMatches(self, n):
s = []
for i in xrange(n):
s.append(str(i + 1)) return self.helper(s) def helper(self, s):
if len(s) == 1:
return s[0]
curr = []
i, j = 0, len(s) - 1
while i < j:
curr.append((s[i], s[j]))
i += 1
j -= 1
return self.helper(curr)  

C++:

// Time:  O(n)
// Space: O(n)
class Solution {
public:
string findContestMatch(int n) {
vector<string> matches(n);
for (int i = 0; i < n; ++i) {
matches[i] = to_string(i + 1);
}
while (matches.size() / 2) {
vector<string> next_matches;
for (int i = 0; i < matches.size() / 2; ++i) {
next_matches.emplace_back("(" + matches[i] + "," + matches[matches.size() - 1 - i] + ")");
}
swap(matches, next_matches);
}
return matches[0];
}
};

C++:

class Solution {
public:
string findContestMatch(int n) {
vector<string> v;
for (int i = 1; i <= n; ++i) v.push_back(to_string(i));
while (n > 1) {
for (int i = 0; i < n / 2; ++i) {
v[i] = "(" + v[i] + "," + v[n - i - 1] + ")";
}
n /= 2;
}
return v[0];
}
};

C++:

class Solution {
public:
string findContestMatch(int n) {
vector<string> v;
for (int i = 1; i <= n; ++i) v.push_back(to_string(i));
helper(n, v);
return v[0];
}
void helper(int n, vector<string>& v) {
if (n == 1) return;
for (int i = 0; i < n; ++i) {
v[i] = "(" + v[i] + "," + v[n - i - 1] + ")";
}
helper(n / 2, v);
}
};

  

  

All LeetCode Questions List 题目汇总

[LeetCode] 544. Output Contest Matches 输出比赛匹配对的更多相关文章

  1. [LeetCode] Output Contest Matches 输出比赛匹配对

    During the NBA playoffs, we always arrange the rather strong team to play with the rather weak team, ...

  2. 【leetcode】544. Output Contest Matches

    原题 During the NBA playoffs, we always arrange the rather strong team to play with the rather weak te ...

  3. 【LeetCode】544. Output Contest Matches 解题报告 (C++)

    作者: 负雪明烛 id: fuxuemingzhu 个人博客:http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 遍历 日期 题目地址:https://leetcode ...

  4. LeetCode Output Contest Matches

    原题链接在这里:https://leetcode.com/problems/output-contest-matches/description/ 题目: During the NBA playoff ...

  5. LeetCode 544----Output Contest Matches

    During the NBA playoffs, we always arrange the rather strong team to play with the rather weak team, ...

  6. BZOJ1612: [Usaco2008 Jan]Cow Contest奶牛的比赛

    1612: [Usaco2008 Jan]Cow Contest奶牛的比赛 Time Limit: 5 Sec  Memory Limit: 64 MBSubmit: 645  Solved: 433 ...

  7. Bzoj 1612: [Usaco2008 Jan]Cow Contest奶牛的比赛 传递闭包,bitset

    1612: [Usaco2008 Jan]Cow Contest奶牛的比赛 Time Limit: 5 Sec  Memory Limit: 64 MBSubmit: 891  Solved: 590 ...

  8. BZOJ 1612: [Usaco2008 Jan]Cow Contest奶牛的比赛( floyd )

    对于第 i 头牛 , 假如排名比它高和低的数位 n - 1 , 那么他的 rank 便可以确定 . floyd -------------------------------------------- ...

  9. [bzoj1612][Usaco2008 Jan]Cow Contest奶牛的比赛_dfs

    Cow Contest奶牛的比赛 bzoj-1612 Usaco-2008 Jan 题目大意:题目链接. 注释:略. 想法: 我们对于每个点dfs,看一下比这个点大的点加上比这个点小的点是否是n-1即 ...

随机推荐

  1. APT 信息收集——shodan.io ,fofa.so、 MX 及 邮件。mx记录查询。censys.io查询子域名。

    信息收集 目标是某特殊机构,外网结构简单,防护严密.经探测发现其多个子机构由一家网站建设公司建设. 对子域名进行挖掘,确定目标ip分布范围及主要出口ip. 很多网站主站的访问量会比较大.往往主站都是挂 ...

  2. destoon下动态链接301到伪静态(ngnix)

    分享一个destoon6.0/7.0下动态链接301到伪静态上面,实现权重提升. if ($request_uri ~* "^/index.php\?itemid=(\d+)&mod ...

  3. nginx1.15.10配置使用非https访问返回403

    nginx版本号:nginx version: nginx/1.15.10 server { listen 443 default ssl; server_name app.test.com; if ...

  4. 记录一次编译安装Pg_rman缺少依赖包的问题

    系统版本:CentOS版本6.10(最终版) pg_rman:https://github.com/ossc-db/pg_rman -bash-4.1$ makegcc -Wall -Wmissing ...

  5. Linux中的CentOS 6克隆之后修改

    Centos6 克隆后的简单的网络配置 第一步:修改主机名 $ vi /etc/sysconfig/network     第二步: $ vi  /etc/udev/rules.d/70-persis ...

  6. 深入理解JVM内存分配和常量池

    一.虚拟机的构成 虚拟结主要由运行时数据区.执行引擎.类加载器三者构成: 而我们所说的JVM内存模型指的就是运行时数据区,下面具体分析一下运行时数据区: 二.运行时数据区组成和各个区域的作用 我们看到 ...

  7. 简述Python的深浅拷贝以及应用场景?

    浅拷贝:copy.copy                       深拷贝:copy.deepcopy 浅拷贝指仅仅拷贝数据集合的第一层数据,深拷贝指拷贝数据集合的所有层 主要应用在字符串,数字的 ...

  8. php生成pdf,php+tcpdf生成pdf, php pdf插件

    插件例子:https://tcpdf.org/examples/ 下载tcpdf插件: demo // Include the main TCPDF library (search for insta ...

  9. 10.31-11.1Test(未完)

    10.31-11.1Test 题目 描述 做法 \(BSOJ5177\) 求在\(n\)个数里选\(K\)个的所有方案的异或和之和 按位讨论,组合数算 \(BSOJ5178\) 化简\(\displa ...

  10. vue的操作:使用手机访问电脑的页面做法如下:

    安装好node.js 和 npm 后,配置好路由,且可以在电脑中正常访问页面时, 只要修改我的项目:my-project 下面的config--->index.js--->里面的 host ...