golang 解法, 执行用时: 4 ms, 内存消耗: 3.9 MB, 提交时间: 2023-10-21 20:12:35

func minimumKeypresses(s string) int {
	alp := make([]int, 26)
	for i := 0; i < len(s); i++ {
		alp[s[i]-'a']++
	}
	sort.Ints(alp)
	ans := 0
	for i := 25; i >= 0; i-- {
		if alp[i] == '0' {
			break
		}
		if (26-i)%9 == 0 {
			ans += alp[i] * ((26 - i) / 9)
		} else {
			ans += alp[i] * ((26-i)/9 + 1)
		}
	}
	return ans
}

rust 解法, 执行用时: 0 ms, 内存消耗: 2 MB, 提交时间: 2023-10-21 20:12:08

impl Solution {
    pub fn minimum_keypresses(s: String) -> i32 {
        let mut cnt = s
            .bytes()
            .fold([0;26], |mut mp, c| {
                mp[c as usize - 'a' as usize] += 1;
                mp
            });

        cnt.sort_by(|a, b| b.cmp(&a));

        cnt 
            .into_iter()   
            .enumerate()
            .fold(0, |acc, (i, v)| {
                if i < 9 {
                    acc + v
                } else if i < 18 {
                    acc + 2 * v
                } else {
                    acc + 3 * v
                }
            })
    }
}

cpp 解法, 执行用时: 16 ms, 内存消耗: 9 MB, 提交时间: 2023-10-21 20:11:45

class Solution {
public:
    int minimumKeypresses(string s) {
        vector<int> vec(26);
        for(char c: s) vec[c - 'a']++; // 计数
        sort(vec.rbegin(), vec.rend()); // 从大到小排序
        partial_sum(vec.begin(), vec.end(), vec.begin()); // 做前缀和方便计算
        return vec[8] + (vec[17] - vec[8]) * 2 + (vec[25] - vec[17]) * 3;
    }
};

python3 解法, 执行用时: 64 ms, 内存消耗: 16.6 MB, 提交时间: 2023-10-21 20:11:22

class Solution:
    def minimumKeypresses(self, s: str) -> int:
        counter=collections.Counter(s)
        sorted_counter = sorted(counter.items(), key=lambda kv: kv[1], reverse=True)
        #print(sorted_counter)
        res=0

        for i, ele in enumerate(sorted_counter):
            res+=(i//9+1)*ele[1]

        return res