Output Contest Matches

给一个数字n, 表示n个team, 每次规定一个比赛是最强的打最弱的, 依次比赛, 求比赛队伍的输出.

模拟运行一下就行.

class Solution {
public:
    string findContestMatch(int n) {
        deque<string> dq;
        for(int i = 1; i <= n; i++){
            dq.push_back(to_string(i));
        }
        while(dq.size() != 1) {
            int size = dq.size();
            deque<string> tmp;
            for(int i = 0; i < size / 2; i++) {
                string a = dq.front();
                string b = dq.back();
                dq.pop_front();
                dq.pop_back();
                tmp.push_back("(" + a + "," + b + ")");
            }
            dq = tmp;
        }
        return dq.front();
    }
};