leetcode 3014. Minimum Number of Pushes to Type Word I

https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-i/description/

LeetCode - The World's Leading Online Programming Learning Platform

 

class Solution:
    def minimumPushes(self, word: str) -> int:
        check = [[x, word.count(x)]for x in word]
        check.sort(key = lambda x : -x[1])
        eight = 0
        penalty = 1
        answer = 0
        for fre in check:
            eight += 1
            answer += fre[1]*penalty
            if eight == 8:
                penalty += 1
                eight = 0
        return answer

빈도수가 높게 나오는 애들을 앞자리에 배치하고 
빈도수가 적게 나오는 애들은 뒷자리에 배치하는 방식 카운팅은 선형탐색