zoukankan      html  css  js  c++  java
  • Output Contest Matches

    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 finalcontest 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.
     1 public class Solution {
     2     public String findContestMatch(int n) {
     3         List<String> storage = new ArrayList<String>();
     4         for (int i = 1; i <= n; i++) {
     5             storage.add(String.valueOf(i));
     6         }
     7         
     8         while (storage.size() != 1) {
     9             List<String> temp = new ArrayList<String>();
    10             int i = 0, j = storage.size() - 1;
    11             while(i < j) {
    12                 String addMe = "(" + storage.get(i++) + "," + storage.get(j--) + ")";
    13                 temp.add(addMe);
    14             }
    15             storage = temp;
    16         }
    17         
    18         return storage.get(0);
    19     }
    20 }
  • 相关阅读:
    Linux常用解压文件
    微信开放平台 获取 component_verify_ticket
    mysql root密码重置
    编译安装LNMP
    JS生成二维码
    CURL采集
    JS拖动浮动DIV
    JS拖动DIV布局
    Nginx 反向代理、负载均衡、页面缓存、URL重写及读写分离详解
    zepto.js 源码注释备份
  • 原文地址:https://www.cnblogs.com/amazingzoe/p/6597837.html
Copyright © 2011-2022 走看看