{"id":6392,"date":"2020-03-02T00:31:51","date_gmt":"2020-03-02T08:31:51","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=6392"},"modified":"2020-03-02T00:36:51","modified_gmt":"2020-03-02T08:36:51","slug":"leetcode-1366-rank-teams-by-votes","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/simulation\/leetcode-1366-rank-teams-by-votes\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1366. Rank Teams by Votes"},"content":{"rendered":"\n

In a special ranking system, each voter gives a rank from highest to lowest to all teams participated in the competition.<\/p>\n\n\n\n

The ordering of teams is decided by who received the most position-one votes. If two or more teams tie in the first position, we consider the second position to resolve the conflict, if they tie again, we continue this process until the ties are resolved. If two or more teams are still tied after considering all positions, we rank them alphabetically based on their team letter.<\/p>\n\n\n\n

Given an array of strings votes<\/code> which is the votes of all voters in the ranking systems. Sort all teams according to the ranking system described above.<\/p>\n\n\n\n

Return a string of all teams<\/em> sorted<\/strong> by the ranking system.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> votes = [\"ABC\",\"ACB\",\"ABC\",\"ACB\",\"ACB\"]\nOutput:<\/strong> \"ACB\"\nExplanation:<\/strong> Team A was ranked first place by 5 voters. No other team was voted as first place so team A is the first team.\nTeam B was ranked second by 2 voters and was ranked third by 3 voters.\nTeam C was ranked second by 3 voters and was ranked third by 2 voters.\nAs most of the voters ranked C second, team C is the second team and team B is the third.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> votes = [\"WXYZ\",\"XYZW\"]\nOutput:<\/strong> \"XWYZ\"\nExplanation:<\/strong> X is the winner due to tie-breaking rule. X has same votes as W for the first position but X has one vote as second position while W doesn't have any votes as second position. \n<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> votes = [\"ZMNAGUEDSJYLBOPHRQICWFXTVK\"]\nOutput:<\/strong> \"ZMNAGUEDSJYLBOPHRQICWFXTVK\"\nExplanation:<\/strong> Only one voter so his votes are used for the ranking.\n<\/pre>\n\n\n\n
Example 4:<\/strong><\/p>\n\n\n\n
Input:<\/strong> votes = [\"BCA\",\"CAB\",\"CBA\",\"ABC\",\"ACB\",\"BAC\"]\nOutput:<\/strong> \"ABC\"\nExplanation:<\/strong> \nTeam A was ranked first by 2 voters, second by 2 voters and third by 2 voters.\nTeam B was ranked first by 2 voters, second by 2 voters and third by 2 voters.\nTeam C was ranked first by 2 voters, second by 2 voters and third by 2 voters.\nThere is a tie and we rank teams ascending by their IDs.\n<\/pre>\n\n\n\n
Example 5:<\/strong><\/p>\n\n\n\n
Input:<\/strong> votes = [\"M\",\"M\",\"M\",\"M\"]\nOutput:<\/strong> \"M\"\nExplanation:<\/strong> Only team M in the competition so it has the first rank.\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 1 <= votes.length <= 1000<\/code><\/li>
  • 1 <= votes[i].length <= 26<\/code><\/li>
  • votes[i].length == votes[j].length<\/code> for 0 <= i, j < votes.length<\/code>.<\/li>
  • votes[i][j]<\/code> is an English upper-case<\/strong> letter.<\/li>
  • All characters of votes[i]<\/code> are unique.<\/li>
  • All the characters that occur in votes[0]<\/code> also occur<\/strong> in votes[j]<\/code> where 1 <= j < votes.length<\/code>.<\/li><\/ul>\n\n\n\n
    Solution: Sort by rank<\/strong><\/h2>\n\n\n\n
    Time complexity: O(v*n + n^2*logn)
    Space complexity: O(n*n)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua\nclass Solution {\npublic:\n  string rankTeams(vector& votes) {\n    const int n = votes[0].length();\n    string ans(votes[0]);\n    vector> rank(26, vector(n));\n    \n    for (const auto& vote : votes)\n      for (int i = 0; i < n; ++i)\n        ++rank[vote[i] - 'A'][i];\n    \n    sort(begin(ans), end(ans), [&](const char i, const char j) {\n      if (rank[i - 'A'] != rank[j - 'A']) return rank[i - 'A'] > rank[j - 'A'];\n      return i < j;\n    });    \n    return ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n\n\n\n
    <\/p>\n","protected":false},"excerpt":{"rendered":"
    In a special ranking system, each voter gives a rank from highest to lowest to all teams participated in the competition. The ordering of teams is…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[48],"tags":[177,440,179,15],"class_list":["post-6392","post","type-post","status-publish","format-standard","hentry","category-simulation","tag-medium","tag-rank","tag-simulation","tag-sorting","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/6392","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=6392"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/6392\/revisions"}],"predecessor-version":[{"id":6394,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/6392\/revisions\/6394"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=6392"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=6392"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=6392"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}