[Leetcode] 544. Output Contest Matches 解题报告
来源:互联网 发布:网络视频教学 编辑:程序博客网 时间:2024/05/23 20:08
题目:
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.
思路:
首先构造一个字符串数组,里面包含“1”,“2”,... "n"。然后不断让第一个元素和最后一个元素进行合并,进而生成新的字符串数组。当字符串数组的大小减小到1的时候,就可以返回了。
代码:
class Solution {public: string findContestMatch(int n) { vector<string> s; for (int i = 1; i <= n; ++i) { s.push_back(to_string(i)); } while (s.size() > 1) { s = merge(s); } return s[0]; }private: vector<string> merge(vector<string> &s) { vector<string> ret; for (int i = 0; i < s.size() / 2; ++i) { ret.push_back('(' + s[i] + ',' + s[s.size() - 1 - i] + ')'); } return ret; }};
- [Leetcode] 544. Output Contest Matches 解题报告
- 544. Output Contest Matches
- LeetCode Weekly Contest 56 解题报告
- pku 2234(Matches Game)解题报告
- [Contest] THUSC 2016 解题报告
- LeetCode 解题报告索引
- [LeetCode]Permutations,解题报告
- Leetcode Triangle 解题报告
- [LeetCode]Anagrams,解题报告
- leetCode解题报告
- [LeetCode]Candy, 解题报告
- 【LeetCode】Candy 解题报告
- 【LeetCode】Triangle 解题报告
- 【LeetCode】Permutations 解题报告
- LeetCode 解题报告 LinkedListCycleII
- LeetCode 解题报告 Candy
- 【LeetCode】Anagrams 解题报告
- 【LeetCode】Combinations 解题报告
- CVE-2014-3153浅析-Android内核释放重引用(towelroot)漏洞
- 为啥要用位运算代替取模呢
- Python之学习总结第二天
- 使用稀疏索引来判断键是否存在
- 调用Dubbo服务报以下错误:RemotingException: message can not send, because channel is closed .
- [Leetcode] 544. Output Contest Matches 解题报告
- 日本人口每年下降90万人?日本:用机器人补足空缺
- requestFeature() must be called before adding content
- ActiveMQ整合Spring的配置文件
- 禁止浏览器记录文本框之前输入过的内容
- 脚本检查浏览器及其版本
- C++ 冒泡排序及优化
- 自定义RadioGroup动态添加RadioButton,并获取选中radioButton的位置
- 刚刚Magic Leap One正式发布,2018年发货,AR智能眼镜市场恐将刮起一场新的风暴