leetcode1366

class Solution:
    def rankTeams(self, votes: 'List[str]') -> str:
        dic = {}
        n = len(votes)
        m = len(votes[0])
        mat = [[0 for _ in range(26)] for _ in range(26)]
        for i in range(n):
            cur = votes[i]
            for j in range(m):
                vote = cur[j]
                code = ord(vote) - 65#row number
                mat[code][j] += 1
        #print(mat)
        for i in range(26):
            key = ''
            for j in range(26):
                cur = str(mat[i][j]).zfill(4)
                #print(cur)
                key += cur
            #print(key)
            if key != '0' * 26 * 4:
                if key not in dic:
                    dic[key] = [chr(i + 65)]
                else:
                    dic[key].append(chr(i + 65))
        li = sorted(dic.items(),key=lambda x:x[0],reverse = True)
        result = []
        for l in li:
            temp = sorted(l[1])
            result += temp
        return ''.join(result)

算法思路：使用26 * 26的矩阵，存储每一个字符的每一个排名的次数。

然后遍历这个矩阵，每一行生成一个4*26的key，根据key倒序排列。同样的key的字符，再按照字符顺序排列。